#140 Word Break II

Description

Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order.

Note that the same word in the dictionary may be reused multiple times in the segmentation.

Examples

Example 1:

Input: s = “catsanddog”, wordDict = [“cat”,“cats”,“and”,“sand”,“dog”]
Output: [“cats and dog”,“cat sand dog”]

Example 2:

Input: s = “pineapplepenapple”, wordDict = [“apple”,“pen”,“applepen”,“pine”,“pineapple”]
Output: [“pine apple pen apple”,“pineapple pen apple”,“pine applepen apple”]
Explanation: Note that you are allowed to reuse a dictionary word.

Example 3:

Input: s = “catsandog”, wordDict = [“cats”,“dog”,“sand”,“and”,“cat”]
Output: []

Constraints:

1 <= s.length <= 20
1 <= wordDict.length <= 1000
1 <= wordDict[i].length <= 10
s and wordDict[i] consist of only lowercase English letters.
All the strings of wordDict are unique.

思路

他和139其实是很类似的，只是140需要遍历所有的情况，而139达成一个情况就可以继续下一次循环，其他的也没什么好说的，用List<String>代替Boolean就好啦

代码

class Solution {
    public List<String> wordBreak(String s, List<String> wordDict) {
        List<String>[] save = new List[s.length() + 1];
        
        for (int i = 0; i < s.length() + 1; i++){
            save[i] = new ArrayList<String>();
        }
        save[0].add("");
        
        for (int i = 1; i < s.length() + 1; i++){
            List<String> tmp = new ArrayList<>();
            for (String word: wordDict){
                if (i - word.length() >= 0 && save[i - word.length()].size() > 0 && s.substring(i - word.length(), i).equals(word)){
                    for (String str: save[i - word.length()])
                        tmp.add(str + " " + word);
                }
            }
            save[i] = new ArrayList<>(tmp);
            
        }
        
        List<String> answers = save[s.length()];
        for (int i = 0; i < answers.size(); i++){
            answers.set(i, answers.get(i).substring(1));
        }
        return answers;
    }
}