[Leetcode]208. Implement Trie (Prefix Tree)

基础题，生成一个Trie树 

struct NODE{
    int val;
    NODE * next[26];
    NODE(){
        val = 0;
        for(int i = 0;i < 26;++i){
            next[i] =  nullptr;
        }
    }
};
const  int maxn = 200;
class Trie {
    NODE *root;

public:
    /** Initialize your data structure here. */
    Trie() {
        root = new NODE();
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        NODE* p = root;
        for(int i = 0;i < word.size();i++){
            if(p->next[word[i] - 'a'] == nullptr){
                p->next[word[i] - 'a'] = new NODE();
            }
            p = p->next[word[i]- 'a']; 
        }
        ++p->val;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        NODE* p = root;
        for(int i = 0;i < word.size();i++){
            if(p->next[word[i] - 'a'] == nullptr){
                return false;
            }
            p =p->next[word[i]- 'a']; 
        }
        if(p->val) return true;
        else       return false;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        NODE* p = root;
        for(int i = 0;i <  prefix.size();i++){
            if(p->next[prefix[i] - 'a'] == nullptr){
                return false;
            }
            p =p->next[ prefix[i]- '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);
 */