139. 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".

UPDATE (2017/1/4):
The wordDict parameter had been changed to a list of strings (instead of a set of strings). Please reload the code definition to get the latest changes.

这道题牵扯到多对一的匹配，用动态规划解题。建立boolean数组存储每一位是否能够组合得到。然后遍历s字符串，如果之前boolean的某一位是true而且dict里又有s的子序列，那么可以设置这一位的boolean为true，最后返回的是boolean最后一位的值，如果这一位是true，说明可以组合到这一位。代码如下：

public class Solution {
    public boolean wordBreak(String s, List<String> wordDict) {
        int len = s.length();
        boolean[] res = new boolean[len + 1];
        res[0] = true;
        for (int i = 1; i <= len; i ++) {
            for (int j = i - 1; j >= 0; j --) {
                if (res[j] && wordDict.contains(s.substring(j, i))) {
                    res[i] = true;
                    break;
                }
            }
        }
        return res[len];
    }
}