实现 Trie-LintCode

实现一个 Trie，包含 insert, search, 和 startsWith 这三个方法。

注意事项：
你可以假设所有的输入都是小写字母a-z。

样例：

insert("lintcode")
search("code") // return false
startsWith("lint") // return true
startsWith("linterror") // return false
insert("linterror")
search("lintcode) // return true
startsWith("linterror") // return true

#ifndef C442_H
#define C442_H
#include<iostream>
#include<string>
using namespace std;
class TrieNode {
public:
    // Initialize your data structure here.
    TrieNode *child[26];
    bool isWord;
    TrieNode() {
        this->isWord = false;
        for (auto &c : child)
            c = NULL;
    }
};

class Trie {
public:
    Trie() {
        // do intialization if necessary
        root = new TrieNode();
    }

    /*
    * @param word: a word
    * @return: nothing
    */
    void insert(string &word) {
        // write your code here
        TrieNode *p = root;
        for (auto c : word)
        {
            int i = c - 'a';
            if (!p->child[i])
                p->child[i] = new TrieNode();
            p = p->child[i];
        }
        p->isWord = true;
    }

    /*
    * @param word: A string
    * @return: if the word is in the trie.
    */
    bool search(string &word) {
        // write your code here
        TrieNode *p = root;
        for (auto c : word)
        {
            int i = c - 'a';
            if (!p->child[i])
                return false;
            p = p->child[i];
        }
        return p->isWord;
    }

    /*
    * @param prefix: A string
    * @return: if there is any word in the trie that starts with the given prefix.
    */
    bool startsWith(string &prefix) {
        // write your code here
        TrieNode *p = root;
        for (auto c : prefix)
        {
            int i = c - 'a';
            if (!p->child[i])
                return false;
            p = p->child[i];
        }
        return true;
    }
private:
    TrieNode *root;
};
#endif