Word Break

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assume the dictionary does not contain duplicate words.

For example, given s = "leetcode", dict = ["leet", "code"].

Return true because "leetcode" can be segmented as "leet code".

Code:

    public class Solution {
        public boolean wordBreak(String s, Set<String> wordDict) {
            boolean[] result = new boolean[s.length() + 1];
            result[0] = true;
            for (int i = 1; i <= s.length(); i++) {
                for (int j = 0; j < i; j++) {
                    String sub = s.substring(j,i);
                    result[i] = result[i] || (result[j] && wordDict.contains(sub));
                }
            }
            return result[s.length()];
        }
    }