leetcode：208. 实现 Trie (前缀树)

链接：https://leetcode-cn.com/problems/implement-trie-prefix-tree/
实现一个前缀树（节点），一个前缀树节点需要保存它可能的26个孩子的信息，以及这个节点是不是一个单词的结尾。
C++代码：

class Trie {
    Trie * children[26];
    bool isWord = false;
public:
    /** Initialize your data structure here. */
   
    Trie() {
        for(int i = 0;i<26;i++)
            children[i] = NULL;
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        Trie * temp  = this;
        for (char c: word)
        {
            if(!temp->children[c-'a'])
                temp->children[c-'a'] = new Trie();
            temp = temp->children[c-'a'];
        }
        temp->isWord = true;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        Trie * temp  = this;
        for (char c: word)
        {
            if(!temp->children[c-'a'])
                return false;
            temp = temp->children[c-'a'];
        }
        return temp->isWord;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        Trie * temp  = this;
        for (char c:prefix)
        {
            if(!temp->children[c-'a'])
                return false;
            temp = temp->children[c-'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);
 */