Leetcode刷题笔记(部分非原创)(131-140题)

139. Word Break

     leetcode链接:https://oj.leetcode.com/problems/word-break/

     DP的思想。设置boolean数组存储，canBreak[i]表示0~i的字符是否满足

public boolean wordBreak(String s, Set<String> dict) {
     int length = s.length();
     boolean[] canBreak = new boolean[length];
     for(int i = 0; i < length; i++) {
          canBreak[i] = dict.contains(s.substring(0, i + 1));
          if(canBreak[i]) {
               continue;
          }
          for(int j = 0; j < i; j++) {
               if(canBreak[j] && dict.contains(s.substring(j + 1, i + 1))) {
                      canBreak[i] = true;
                      break;
               }
          }
    }  
    return canBreak[length - 1];
}

 

 

顺便推广自己的微店---美国加拿大留学申请咨询 http://weidian.com/s/316012464?wfr=c