【LeetCode】Word Break

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

解法：动态规划

参考：https://leetcode.com/discuss/18904/java-implementation-using-dp-in-two-ways

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