标签：style class blog code java http
Question:
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".
-----------------------------------------
Solution:dp
1 public class Solution { 2 public boolean wordBreak(String s, Set<String> dict) { 3 boolean[] state=new boolean[s.length()+1]; 4 state[0]=true; 5 for(int i=1;i<=s.length();i++){ 6 for(int j=i-1;j>=0;j--){ 7 if(state[j]&&dict.contains(s.substring(j, i))){ 8 state[i]=true; 9 break; 10 } 11 } 12 } 13 return state[s.length()]; 14 } 15 }
[Leetcode] Word Break,布布扣,bubuko.com
标签：style class blog code java http
原文地址：http://www.cnblogs.com/Phoebe815/p/3783878.html
