LeetCode(208) Implement Trie (Prefix Tree)

参考Yu’s Coding Garden之后发现在Trie结构体中的count是没有必要的，所以删去。

---

本题也促使我思考所谓的“树”，所谓的“图”究竟是什么；所谓的“栈”，所谓的“map容器”。组织数据的方式，不是数据，不是结构体。

代码如下：

class TrieNode {
public:

    int val;
    TrieNode *children[26];

    // Initialize your data structure here.
    TrieNode() {

        val = 0;
        for (int i=0; i < 26; i++) children[i] = NULL;


    }
};

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

    // Inserts a word into the trie.
    void insert(string word) {

        TrieNode *p = root;

        for(int i = 0; i < word.size(); i++) {

            if(p->children[word[i] - 'a'] == NULL)  p->children[word[i] - 'a'] = new TrieNode();

            p = p->children[word[i] - 'a'];

        }

        p->val = 1;

    }

    // Returns if the word is in the trie.
    bool search(string word) {

        TrieNode *p = root;
        for(int i = 0; i < word.size(); i++) {

            if(p->children[word[i] - 'a'] == NULL) return false;

            p = p->children[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) {

        TrieNode *p = root;
        for(int i = 0; i < prefix.size(); i++) {

            if(p->children[prefix[i] - 'a'] == NULL) return false;

            p = p->children[prefix[i] - 'a'];

        }

        return true;

    }

private:
    TrieNode* root;
};

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