2021-12-28 472. 连接词（Trie树、DFS、一个有意思的剪枝）

• 472. 连接词
• 1280ms->124ms

//朴素Trie再DFS做法
//必须剪枝时间复杂度才够
class Solution {
public:
    int son[100000][26];
    int end[100000];
    int idx = 0;
    bool dfs(string& s, int startIndex){
        if(startIndex == s.size()) return true;

        string temp = "";
        for(int i = startIndex; i < s.size(); i++){
            temp += s[i];
            if(query(temp)){
                if(dfs(s, i + 1)) return true;
            }
            
        }
        return false;
    }
    bool query(string& s){
        int p = 0;
        for(char& c: s){
            int x = c - 'a';
            if(son[p][x] == -1) return false;
            p = son[p][x];
        }
        return end[p];
    }
    void insert(string& s){
        int p = 0;
        for(char& c : s){
            int x = c - 'a';
            if(son[p][x] == -1) son[p][x] = ++idx;
            p = son[p][x];
        }
        end[p] = 1;
    }
    bool static cmp(string& a, string& b){
        return a.size() < b.size();
    }
    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
        memset(son, -1, sizeof son);
        memset(end, 0, sizeof end);
        int n = words.size();
        sort(words.begin(), words.end(), cmp);
        vector<string> ans;
        for(int i = 0; i < n; i++){
            if(words[i] == "") continue;
            
            if(dfs(words[i], 0)) ans.push_back(words[i]);
            //A是X、Y、Z连接词，则由A构成的连接词B可以由X、Y、Z构成
            //剪枝，A不用再添加
            else insert(words[i]);
        }
        return ans;
    }
};

//Query操作中直接DFS
class Solution {
public:
    int son[100000][26];
    int end[100000];
    int idx = 0;
    bool dfs(string& s, int startIndex){
        if(startIndex == s.size()) return true;

        string temp = "";
        for(int i = startIndex; i < s.size(); i++){
            temp += s[i];
            if(query(temp)){
                if(dfs(s, i + 1)) return true;
            }
            
        }
        return false;
    }
    bool query(string& s){
        int p = 0;
        for(char& c: s){
            int x = c - 'a';
            if(son[p][x] == -1) return false;
            p = son[p][x];
        }
        return end[p];
    }
    void insert(string& s){
        int p = 0;
        for(char& c : s){
            int x = c - 'a';
            if(son[p][x] == -1) son[p][x] = ++idx;
            p = son[p][x];
        }
        end[p] = 1;
    }
    bool static cmp(string& a, string& b){
        return a.size() < b.size();
    }
    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
        memset(son, -1, sizeof son);
        memset(end, 0, sizeof end);
        int n = words.size();
        sort(words.begin(), words.end(), cmp);
        vector<string> ans;
        for(int i = 0; i < n; i++){
            if(words[i] == "") continue;
            
            if(dfs(words[i], 0)) ans.push_back(words[i]);
            //A是X、Y、Z连接词，则由A构成的连接词B可以由X、Y、Z构成
            //剪枝，A不用再添加
            else insert(words[i]);
        }
        return ans;
    }
};