class Solution {
public boolean wordBreak(String s, List<String> wordDict) {
int n = s.length();
Set<String> set = new HashSet<>(wordDict);
boolean[] dp = new boolean[n + 1];
// dp[0]
dp[0] = true;
for (int len = 1; len < n + 1; len++) {
for (int j = 0; j < len; j++) {
if (dp[j] && set.contains(s.substring(j, len))) {
dp[len] = true;
break;
}
}
}
return dp[n];
}
}
139. 单词拆分
最新推荐文章于 2024-08-02 23:27:55 发布