leetcode每日一题-745.前缀和后缀搜索

745.前缀和后缀搜索

解题思路

双字典树 树的每个节点保存一下它是哪些单词的前缀（后缀），根据题目所需，保存下标即可

然后找出公共前缀和公共后缀的下标集合，双指针从后往前找最大的下标

实践证明：二维数组开销太大，并且有个恶心的地方，在返回下标集合的时候，由于返回$vector<int>$是值拷贝，开销太大~~（ TLE~~~~）~~，最后多方查证 把$vector<int>$改为 $vector<int>\&$ 就万事大吉啦

代码

class Trie{
public:
    vector<Trie*>children;
    vector<int>idx;
    vector<int>emp;
    Trie():children(26),idx(){}
    void insert(string s, int i)
    {
        Trie* root = this;
        for(auto ch : s)
        {
            int x = ch-'a';
            if(root->children[x]==nullptr)root->children[x] = new Trie();
            root = root->children[x];
            root->idx.push_back(i);
        }
    }

    vector<int>& startWith(string prefix)
    {
        Trie* root = this;
        for(auto ch : prefix)
        {
            int x = ch-'a';
            if(root->children[x]==nullptr)return emp;
            root = root->children[x];
        }
        return root->idx;
    }
};
class WordFilter {
public:
    Trie* tr1,*tr2;

    WordFilter(vector<string>& words) {
        tr1 = new Trie();
        tr2 = new Trie();
        int i=0;
        for(auto& s : words)
        {
            tr1->insert(s, i);
            reverse(s.begin(), s.end());
            tr2->insert(s, i);
            ++i;
        }
    }
    
    int f(string pref, string suff) {
        vector<int>&id1 = tr1->startWith(pref);
        reverse(suff.begin(), suff.end());
        vector<int>&id2 = tr2->startWith(suff);

        for(int i=id1.size()-1,j=id2.size()-1; i>=0&&j>=0;)
        {
            if(id1[i]==id2[j])
            {
                return id1[i];
            } else if(id1[i]>id2[j]){
                i--;
            } else j--;
        }
        return -1;
    }
};