单词拆分 II

单词拆分 II

给定一个字符串 s 和一个字符串字典 wordDict ，在字符串 s 中增加空格来构建一个句子，使得句子中所有的单词都在词典中。以任意顺序 返回所有这些可能的句子。

**注意：**词典中的同一个单词可能在分段中被重复使用多次。

示例 1：

输入:s = "catsanddog", wordDict = ["cat","cats","and","sand","dog"]
输出:["cats and dog","cat sand dog"]

示例 2：

输入:s = "pineapplepenapple", wordDict = ["apple","pen","applepen","pine","pineapple"]
输出:["pine apple pen apple","pineapple pen apple","pine applepen apple"]
解释: 注意你可以重复使用字典中的单词。

示例 3：

输入:s = "catsandog", wordDict = ["cats","dog","sand","and","cat"]
输出:[]

提示：

• 1 <= s.length <= 20
• 1 <= wordDict.length <= 1000
• 1 <= wordDict[i].length <= 10
• s 和 wordDict[i] 仅有小写英文字母组成
• wordDict 中所有字符串都 不同

代码：

//记忆化搜索
class Solution {
private:
    unordered_map<int, vector<string>> ans;
    unordered_set<string> wordSet;

public:
    vector<string> wordBreak(string s, vector<string>& wordDict) {
        wordSet = unordered_set(wordDict.begin(), wordDict.end());
        backtrack(s, 0);
        return ans[0];
    }

    void backtrack(const string& s, int index) {
        if (!ans.count(index)) {
            if (index == s.size()) {
                ans[index] = {""};
                return;
            }
            ans[index] = {};
            for (int i = index + 1; i <= s.size(); ++i) {
                string word = s.substr(index, i - index);
                if (wordSet.count(word)) {
                    backtrack(s, i);
                    for (const string& succ: ans[i]) {
                        ans[index].push_back(succ.empty() ? word : word + " " + succ);
                    }
                }
            }
        }
    }
};

//字典树 + BFS
class Trie{
private: 
    bool isend;
    Trie* next[26];
public:
    Trie(){
        isend = false;
        memset(next, 0, sizeof(next));
    }
    void insert(const string& s){
        Trie* node = this;
        for(const char& c : s){
            if (!node->next[c - 'a']) 
                node->next[c - 'a'] = new Trie();
            node = node->next[c - 'a'];
        }
        node->isend = true;
    }
    void dfs(string& s, int pos, vector<bool>& visited, vector<string>& res){
        if (pos == s.size()) {
            string tmp;
            for(int i = 0; i < s.size(); ++i){
                tmp += s[i];
                if (visited[i] && i != s.size() - 1) {
                    tmp += ' ';
                }
            }
            res.push_back(tmp);
            return ;
        }
        Trie* node = this;
        for(int i = pos; i < s.size(); ++i){
            if(node->next[s[i] - 'a']) {
                node = node->next[s[i] - 'a'];
                if(node->isend){
                    visited[i] = true;
                    dfs(s, i + 1, visited, res);
                    visited[i] = false;
                }
            }else return ;
        }
    }
};
class Solution {
public:
    vector<string> wordBreak(string s, vector<string>& wordDict) {
        Trie* root = new Trie();
        vector<bool> visited(s.size(), false);
        for(const string& word : wordDict){
            root->insert(word);
        }
        vector<string> res;
        root->dfs(s, 0, visited, res);
        return res;
    }
};