zoukankan      html  css  js  c++  java
  • Java实现LeetCode 139 单词拆分

    public boolean wordBreak(String s, List<String> wordDict) {
           if(s.length() == 0){
               return false;
           }
           boolean right = false;
           StringBuilder str = new StringBuilder();
           StringBuilder temp = new StringBuilder();
           int j = 0;
           for(char i: s.toCharArray()){
               str.append(i);
               temp.append(i);
               String kl = str.toString() + s.substring(j+1, s.length());
                /*
                "aaaa"。"aaa"
                "aaaaaaa";
                */
               if(wordDict.contains(kl)){
                   right = true;
                   break;
               }
               /*"goalspecial"
                 ["go","goal","goals","special"]
               */
               else if(!wordDict.contains(str.toString()) && wordDict.contains(temp.toString())){
                   right = true;
                   temp = new StringBuilder();
                   str = new StringBuilder();
               }
               else if(wordDict.contains(str.toString())){
                   right = true;
                   str = new StringBuilder();
               }
               else{
                   right = false;
               }
               j++;
           }
           return right;
       }
    
  • 相关阅读:
    dom4j 创建XML文件
    Convert.ToInt32()与int.Parse()的区别
    委托
    工厂模式
    策略模式
    大型网站架构演化
    字符串反转(面试)
    switch(面试)
    带宽计算
    新语法
  • 原文地址:https://www.cnblogs.com/a1439775520/p/13076641.html
Copyright © 2011-2022 走看看