class Solution {
public boolean wordBreak(String s, List<String> wordDict) {
Set<String> word=new HashSet<>(wordDict);
boolean[] dp=new boolean[s.length()+1];//dp[i]===0...i-1,字符串方法()
dp[0]=true; //ge.:i=2,第一次 dp[1]..dp[2]
for(int i=1;i<=s.length();i++){ //<=
for(int j=0;j<i;j++){
if(dp[j]&&word.contains(s.substring(j,i))){ //substring
dp[i]=true;
break;
}
}
}
return dp[s.length()];
}
}