leetcode208

最新推荐文章于 2024-07-01 05:22:02 发布

杨戬没有你我怎么活

最新推荐文章于 2024-07-01 05:22:02 发布

阅读量216

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_36257146/article/details/103882259

版权

leetcode 专栏收录该内容

320 篇文章 0 订阅

订阅专栏

模板题，不解释

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