[leetcode]208. 实现 Trie (前缀树)

struct TrieNode
{
    bool isEnd;   // 是否是一个单词的结束
    TrieNode *next[26];
    TrieNode()
    {
        isEnd = false;
        memset(next, NULL, sizeof(next));
    }
};
class Trie {
private:
    TrieNode *root;
public:
    /** Initialize your data structure here. */
    Trie() {
        root = new TrieNode();
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        TrieNode *node = root;
        for(int i = 0; i < word.size(); i++)
        {
            char ch = word[i];
            if(node->next[ch - 'a'] == NULL)
            {
                node->next[ch - 'a'] = new TrieNode();
            }
            node = node->next[ch - 'a'];
        }
        node->isEnd = true;  //如果单词现在是 app,则node现在指向第4层的结点(root为第1层)
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        TrieNode *node = root;
        for(int i = 0; i < word.size(); i++)
        {
            char ch = word[i];
            if(node->next[ch - 'a'] == NULL)
            {
                return false;
            }
            node = node->next[ch - 'a'];
        }
        return node->isEnd;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        TrieNode *node = root;
        for(int i = 0; i < prefix.size(); i++)
        {
            char ch = prefix[i];
            if(node->next[ch - 'a'] == NULL)
            {
                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);
 */