LeetCode208. 实现 Trie (前缀树)

208. 实现 Trie (前缀树)

字典树

class Trie {
private:   
    bool isEnd;
    Trie* next[26];
public:
    /** Initialize your data structure here. */
    Trie() {
        isEnd = false;
        //memset(next, nullptr, sizeof(next)); 原型：memset(void *s,int ch,size_t n); 
        memset(next, 0, sizeof(next));
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        Trie* node = this;      //dummy head
        for(const char ch : word) {
            if(node->next[ch - 'a'] == nullptr) {
                node->next[ch - 'a'] = new Trie();  //next[c - 'a']不在指向nullptr,表示c已经存在
            }
            node = node->next[ch - 'a'];
        }
        node->isEnd = true;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        Trie* node = this;  //相当于一个dummy head
        for(const char ch : word) {
            node = node->next[ch - 'a'];
            if(node == nullptr) {
                return false;
            }
        }
        return node->isEnd; //必须能以所查询word的最后一个字母结尾才能构成一个单词
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        Trie* node = this;  //dummy head
        for(const char ch : prefix) {
            if(node->next[ch - 'a'] == nullptr) {
                return false;
            }
            node = node->next[ch - 'a'];
        }
        return true;
    }
};

/**
 * Your Trie object will be instantiated and called as such:
 * Trie* obj = new Trie();
 * obj->insert(word);
 * bool param_2 = obj->search(word);
 * bool param_3 = obj->startsWith(prefix);
 */