Leetcode单词的压缩编码(字典树)

class TrieNode{
    TrieNode* child[26];
public:
    int count; // 是否为叶子节点
    TrieNode()
    {
        for(int i=0;i<26;i++) child[i] = NULL;
        count = 0;
    }
    
    TrieNode* get(char c) // 或许字符c对应的child节点
    {
        if(child[c-'a'] == NULL) 
        {
            child[c-'a'] = new TrieNode();
            count++;
        }
        return child[c-'a'];
        
    }
};


class Solution {
public:
    TrieNode* insert(TrieNode* root,string s)
    {
        int Len = s.size();
        // 倒插
        for(int i=Len-1;i>=0;i--)
        {
            root = root->get(s[i]);
        }
        return root;
    } 

    int minimumLengthEncoding(vector<string>& words) {
        int Len = words.size();
        TrieNode* trie = new TrieNode();
        node.clear();
        for(int i=0;i)
        {
            string word = words[i];
            TrieNode* leaf = insert(trie,word);
            node[leaf] = i;
        }
        int ans = 0;
        // map 的遍历方式
        for(auto [node,idx]:node)
        {
            if(node->count == 0) ans += (words[idx].size()+1);
        }
        return ans;
    }

private:
    unordered_mapint> node;
};