139. Word Break java solutions

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> wordDict) {
        boolean[] dp = new boolean[s.length()+1];
        dp[0] = true;
        for(int i = 1; i < dp.length; i++){
            for(int j = i; j >= 0 && !dp[i]; j--){
                if(wordDict.contains(s.substring(i-j,i))){
                    dp[i] = dp[i-j];
                    //break;
                }
            }
        }
        return dp[dp.length-1];
    }
}

使用dp。 解释 二刷再说。