[leetcode] Implement Trie (Prefix Tree)

实现字典树基本功能，包括查找key和前缀。代码如下：

class TrieNode {
public:
    // Initialize your data structure here.
    TrieNode() {
        for(int i = 0; i < 26; ++i)
            next[i] = NULL;
        end = false;
    }
    void insert(string s){
        if(s.empty()){
            end = true;
            return;
        }
        if(next[s[0] - 'a'] == NULL)
            next[s[0] - 'a'] = new TrieNode();
        next[s[0] - 'a']->insert(s.substr(1));
    }
    bool search(string key){
        if(key.empty())
            return end;
        if(next[key[0] - 'a'] == NULL)
            return false;
        return next[key[0] - 'a']->search(key.substr(1));
    }
    bool startsWith(string prefix){
        if(prefix.empty())
            return true;
        if(next[prefix[0] - 'a'] == NULL)
            return false;
        return next[prefix[0] - 'a']->startsWith(prefix.substr(1));
    }
private:
    TrieNode *next[26];
    bool end;
};

class Trie {
public:
    Trie() {
        root = new TrieNode();
    }

    // Inserts a word into the trie.
    void insert(string s) {
        root->insert(s);
    }

    // Returns if the word is in the trie.
    bool search(string key) {
        return root->search(key);
    }

    // Returns if there is any word in the trie
    // that starts with the given prefix.
    bool startsWith(string prefix) {
        return root->startsWith(prefix);
    }

private:
    TrieNode* root;
};