[Leetcode] Word Break

Question:

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

-----------------------------------------

Solution:dp

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