【Leetcode】Word Break I - 动态规划

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

For example, given
s = "leetcode",
dict = ["leet", "code"].

Return true because "leetcode" can be segmented as "leet code".

Java:

http://blog.csdn.net/linhuanmars/article/details/22358863

动态规划 略难理解

public class Solution {
    public boolean wordBreak(String s, Set<String> dict) {
       if(s==null||s.length()==0) return true;
       boolean[] res=new boolean[s.length()+1];
       res[0]=true;
       for(int i=0;i<s.length();i++)
       {
           StringBuilder str= new StringBuilder(s.substring(0,i+1));
           for(int j=0;j<=i;j++)
           {
               if(res[j]&&dict.contains(str.toString()))
               {
                   res[i+1]=true;
               }
               str.deleteCharAt(0);//delete first char
           }
       }
       return res[s.length()];
    }
}

另一种解法：

public class Solution {
    public boolean wordBreak(String s, Set<String> dict) {
        boolean[] canBreak = new boolean[s.length()+10];  
        canBreak[0] = true;     //
          for(int i=0; i<s.length(); i++){  
            if(canBreak[i] == false){  
                continue;  
            }  
            for(String dictS : dict){  
                int len = dictS.length();  
                int end = i + len;  
                if(end > s.length()){  
                    continue;  
                }  
                if(s.substring(i, end).equals(dictS)){  
                    canBreak[end] = true;  
                }  
            }  
        }  
        return canBreak[s.length()];  
    }
}