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".
Subscribe to see which companies asked this question
java code:
public class Solution {
public boolean wordBreak(String s, Set<String> 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] && wordDict.contains(s.substring(j,i))) {
dp[i] = true;
break;
}
}
}
return dp[s.length()];
}
}原文：http://blog.csdn.net/itismelzp/article/details/51615767