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".
public class Solution { public boolean wordBreak(String s, Set<String> dict) { boolean[] dp = new boolean[s.length()+1]; dp[0] = true; int len = s.length(); for(int i = 0; i< len; i++){ if(!dp[i]) continue; for(String e : dict){ // end 为 dict 中的单词长度在substring终止时的下标 int end = i+e.length(); if(end > s.length()) continue; String sub = s.substring(i, end); if(dict.contains(sub)) dp[end] = true; } } return dp[len]; } }
原文：http://www.cnblogs.com/RazerLu/p/3555173.html