Given a string s and a dictionary of words dict, determine ifs 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".
public class Solution { // http://needjobasap.blogspot.com/2014/11/word-break-leetcode.html //http://fisherlei.blogspot.com/2013/11/leetcode-word-break-solution.html public boolean wordBreak(String s, Set<String> dict) { boolean[] dp = new boolean[s.length()+1]; dp[0] = true; // for(int i=0;i<s.length();i++){ for(int i=1;i<=s.length();i++){ for(int j=0; j< i; j++){ if(dp[j] && dict.contains(s.substring(j,i))) { dp[i]=true; break; } } } return dp[s.length()]; } }
原文：http://www.cnblogs.com/jiajiaxingxing/p/4570795.html