LeetCode-Word Break

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"

.

Have you met this question in a real interview?

Solution:

public class Solution {
public boolean wordBreak(String s, Set<String> dict) {
boolean[] break = new boolean[s.length()+1];
break[0] = true;

for (int i=1;i<=s.length();i++){
StringBuilder builder = new StringBuilder;
for (int j=i-1;j>=0;j++){
builder.insert(0,s.charAt(j));
String word = builder.toString();
if (dict.contains(word) && break[j]) {
break[i] = true;
break;
}
}
}

return break[s.length()];
}
}