Implement Trie (Prefix Tree)

1. 解析

主要考察字典树结构, 类似于Word Ladder

struct TrieNode{
    TrieNode* allNode[26];
    bool isWord;
    TrieNode() : isWord(false){
        for (int i = 0; i < 26; ++i){
            allNode[i] = NULL;
        }
    }
};

class Trie {
public:
    /** Initialize your data structure here. */
    Trie() {
          root = new TrieNode();
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        TrieNode* cur = root;
        for (int i = 0; i < word.length(); ++i){
            int index = word[i] - 'a';
            if (! cur->allNode[index]) cur->allNode[index] = new TrieNode();
            cur = cur->allNode[index];
        }
        cur->isWord = true;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        TrieNode* cur = root;
        for (int i = 0; i < word.length(); ++i){
            int index = word[i] - 'a';
            if (! cur->allNode[index]) return false;
            cur = cur->allNode[index];
        }
        return cur->isWord;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        TrieNode* cur = root;
        for (int i = 0; i < prefix.length(); ++i){
            int index = prefix[i] - 'a';
            if (! cur->allNode[index]) return false;
            cur = cur->allNode[index];
        }
        return true;
    }
private:
    TrieNode* root;
};

/**
 * 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);
 */

 [1]https://www.cnblogs.com/grandyang/p/4491665.html