leetcode208 - Implement Trie (Prefix Tree)

题目：
Implement a trie with insert, search, and startsWith methods.
这道题好像相对比较简单，不知道为啥大家的提交准确率感觉挺低的，可能是我忽略了什么东西。TnT

class Trie {
public:
    vector<string>trie;
    /** Initialize your data structure here. */
    Trie() {
        
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        trie.push_back(word);
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        for(auto i : trie)
            if(i == word)return true;
        return false;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        for(auto i : trie)
            if(i.find(prefix) == 0)
                return true;
        return false;
    }
};

/**
 * 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);
 */