leetcode 208 【trie】

就是trie树模板。。

class TrieNode {
public:
    // Initialize your data structure here.
    TrieNode *next[26];
    int have;
    TrieNode() {
        for(int i=0;i<26;i++) next[i]=NULL;
        have=false;
    }
};

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

    // Inserts a word into the trie.
    void insert(string s) {
        TrieNode *p=root;
        int i=0;
        while(i<s.size())
        {
            int tmp=s[i++]-'a';
            if(p->next[tmp]==NULL) p->next[tmp]=new TrieNode(); 
            p=p->next[tmp];
        }
        p->have=1;
    }

    // Returns if the word is in the trie.
    bool search(string key) {
        TrieNode *p=root;
        int i=0;
        while(i<key.size())
        {
            int tmp=key[i++]-'a';
            if(p->next[tmp]) p=p->next[tmp];
            else return false;
        }
        return p->have&&p;
    }

    // Returns if there is any word in the trie
    // that starts with the given prefix.
    bool startsWith(string prefix) {
        TrieNode *p=root;
        int i=0;
        while(i<prefix.size())
        {
            int tmp=prefix[i++]-'a';
            if(p->next[tmp]) p=p->next[tmp];
            else return false;
        }
        return p;
    }

private:
    TrieNode* root;
};

// Your Trie object will be instantiated and called as such:
// Trie trie;
// trie.insert("somestring");
// trie.search("key");