Day46 动态规划 part08
我的思路:
这次的状态方程,dp[j] && word.contains(s.substring(j, i)),如果dp[j] 在字典里面,且j - i也在字典里面,dp[i] 就也在字典里面
解答:
class Solution {
public boolean wordBreak(String s, List<String> wordDict) {
Set<String> word = new HashSet<>(wordDict);
boolean[] dp = new boolean[s.length() + 1];
dp[0] = true;
for(int i = 1; i <= s.length(); i++) {
for(int j = 0; j < i; j++) {
if(dp[j] && word.contains(s.substring(j, i))) {
dp[i] = true;
break;
}
}
}
return dp[s.length()];
}
}