MLE, memory leak, 3093. Longest Common Suffix Queries

[oxolll]

class TrieNode
{
    public:
    TrieNode* next[26];
    int idx;
    TrieNode()
    {
        for (int i=0; i<26; i++)
            next[i] = NULL;
        idx = -1;
    }        
};

class Solution {
    TrieNode* root = new TrieNode();
public:
    void free(TrieNode* cur){ // It will cause MLE error without free the memory.
        for(int i = 0; i < 26; ++i)
        {
            if(cur->next[i] != nullptr)
            {
                free(cur->next[i]);
                delete cur->next[i];
            }
        }
    }
    vector<int> stringIndices(vector<string>& wordsContainer, vector<string>& wordsQuery) 
    {
        vector<pair<string,int>>arr;
        for (int i=0; i<wordsContainer.size(); i++)
        {
            arr.push_back({wordsContainer[i], i});
        }
        
        sort(arr.begin(), arr.end(), [](const pair<string,int>&a, const pair<string,int>&b)
            {
                if (a.first.size() != b.first.size()) 
                    return a.first.size() < b.first.size();
                else 
                    return a.second < b.second;
            });        
        
        for (int i=arr.size()-1; i>=0; i--)
        {
            TrieNode* node = root;
            string s = arr[i].first;
            for (int j=s.size()-1; j>=0; j--)
            {
                if (node->next[s[j]-'a']==NULL)
                    node->next[s[j]-'a'] = new TrieNode();
                node = node->next[s[j]-'a'];
                node->idx = arr[i].second;
            }            
        }
        
        root->idx = arr[0].second;
        vector<int>rets;
        for (auto& query: wordsQuery)
        {
            TrieNode* node = root;
            int ans = -1;
            for (int i=query.size()-1; i>=0; i--)
            {
                if (node->next[query[i]-'a']!=NULL)
                    node = node->next[query[i]-'a'];
                else
                {
                    ans = node->idx;
                    break;
                }
            }
            if (ans==-1)
                ans = node->idx;
            
            rets.push_back(ans);
            
        }
        free(root);
        return rets;
    }
};

[yangizone]

这是来自QQ邮箱的假期自动回复邮件。 您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。