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"
.
Java:
public class Solution {
public boolean wordBreak(String s, Set<String> wordDict) {
boolean[] array = new boolean[s.length()+1];
array[0] = true;
for(int i=0; i<s.length(); i++)
{
for(int j=0; j<=i;j++)
{
if(array[j] && wordDict.contains(s.substring(j, i+1)))
{
array[i+1] = true;
break;
}
}
}
return array[s.length()];
}
}