Word Break

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".

 

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