208. 实现 Trie (前缀树)*【力扣】

题意理解

设计前缀树的类

问题分析

其他

https://www.cnblogs.com/luosongchao/p/3239521.html

https://www.youtube.com/watch?v=ptlwluzeC1I

链接

class Trie {
public:
    /** Initialize your data structure here. */
    Trie() 
        : root (new TrieNode()) 
    {}
    
    ~Trie() {
        if (root)
            delete root;
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        TrieNode * node = root;
        for (const char c : word) {
            auto p = node -> children.emplace (c, nullptr);
            if (p.second)
                p.first -> second = new TrieNode();
            node = p.first -> second;
        }
        node -> is_word = true;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) const {
        const TrieNode * node = find (word);
        return node && node -> is_word;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) const {
        return !!find(prefix);
    }
private:
    struct TrieNode {
        TrieNode()
            :   is_word(false)
        {}
    
        ~TrieNode() {
            for (auto & p : children)
            {
                if (p.second)
                    delete p.second;
            }
        }
    
        unordered_map<char, TrieNode*> children;
        bool is_word;
    };
    const TrieNode * find (const string & prefix) const {
        const TrieNode * node = root;
        for (const char c : prefix)
        {
            auto it = node -> children.find(c);
            if (it == node -> children.end()) {
                return nullptr;
            } else {
                node = it -> second;
            }
            
        }
        return node;
    }
    
    TrieNode * root;    
};