140. Word Break II

原网址为 https://leetcode.com/problems/word-break-ii/description/

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. You may assume the dictionary does not contain duplicate words.

Return all such possible sentences.

For example, given
s = "catsanddog",
dict = ["cat", "cats", "and", "sand", "dog"].

A solution is ["cats and dog", "cat sand dog"].

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.

代码：

class Solution {
public:
    vector<string> wordBreak(string s, vector<string>& wordDict) {
        unordered_set<string> wordSet(wordDict.begin(), wordDict.end());
        
        map<int, vector<string>> dp{{s.size(), {""}}};
        
        
        
        return sentence(s, wordSet, 0, dp);
    }
    
    vector<string> sentence(string s, unordered_set<string>& wordSet, int i, map<int, vector<string>>& dp) {
        if (!dp.count(i)) {
            for (int j = i + 1; j <= s.size(); j++) {
                string sub = s.substr(i, j - i);
                if (wordSet.count(sub)) {
                    for (auto tail : sentence(s, wordSet, j, dp)) {
                        dp[i].push_back(sub + (tail == "" ? "" : " " + tail));
                    }
                }
            }
        }
        return dp[i];
    }
};