Trie (1) -- Implement Trie (Prefix Tree)

Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods.

Note:
You may assume that all inputs are consist of lowercase letters a-z.

此处只是简单的Trie树的构建，不涉及删除等操作。

关于Trie的介绍，请看：http://blog.csdn.net/lucky_greenegg/article/details/9141759

关于c++中的class，请看：http://www.cnblogs.com/mr-wid/archive/2013/02/18/2916309.html

class Trie {
public:

    struct TrieNode{
        bool isWord;
        TrieNode* nextBranch[26];
        TrieNode() : isWord(false) {
            memset(nextBranch, NULL, sizeof(nextBranch));
        }
    };
    TrieNode* root;

    /** Initialize your data structure here. */
    Trie() {
       root = new TrieNode();
    }

    /** Inserts a word into the trie. */
    void insert(string word) {
        TrieNode* p = root;
        for (char c : word){
            int index = c - 'a';  //Ascii(a) = 97
            if (p -> nextBranch[index] == NULL){
                p = p -> nextBranch[index] = new TrieNode();
            }
            else p = p -> nextBranch[index];
        }
        p -> isWord = true;
    }

    /** Returns if the word is in the trie. */
    bool search(string word) {
        TrieNode* p = root;
        for (int i = 0; i < word.size() && p != NULL; i++){
            int index = word[i] - 'a';
            p = p -> nextBranch[index];
        }
        return p && p -> isWord;
    }

    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        TrieNode* p = root;
        for (char c : prefix){
            int index = c - 'a';  //Ascii(a) = 97
            if (p -> nextBranch[index] == NULL)
                return false;
            p = p -> nextBranch[index];
        }
        return true;
    }
};