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".
1 public class Solution { 2 public boolean wordBreak(String s, Set<String> wordDict) { 3 boolean[] dp = new boolean[s.length()+1]; 4 dp[0] = true; 5 for(int i = 1; i < dp.length; i++){ 6 for(int j = i; j >= 0 && !dp[i]; j--){ 7 if(wordDict.contains(s.substring(i-j,i))){ 8 dp[i] = dp[i-j]; 9 //break; 10 } 11 } 12 } 13 return dp[dp.length-1]; 14 } 15 }
使用dp。 解释 二刷再说。
139. Word Break java solutions
原文：http://www.cnblogs.com/guoguolan/p/5671610.html