[leetcode] 208. Implement Trie (Prefix Tree)

原创 2016年05月31日 15:32:54

Implement a trie with insertsearch, and startsWith methods.

Note:
You may assume that all inputs are consist of lowercase letters a-z.

这道题是实现字典树,题目难度为Medium。


可能还有同学不太了解字典树,不了解的同学可以先看下字典树在wiki上的页面(传送门。字典树的优点是插入和查找的时间复杂度为O(m),m为单词长度,但空间复杂度比较庞大。看到一篇介绍Trie的博文写的比较详细,建议不了解字典树的同学也详细看一看(传送门)。


Trie没有析构函数,这里是需要析构函数的,所以加入了采用深度优先搜索的析构函数。其他部分应该没什么难度了,具体代码:

class TrieNode {
public:
    vector<TrieNode*> child;
    bool isIn;
    // Initialize your data structure here.
    TrieNode() : child(vector<TrieNode*>(26, NULL)), isIn(false) {}
};

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

    ~Trie() {
        delNode(root);
    }
    
    void delNode(TrieNode* n) {
        for(int i=0; i<26; ++i) {
            if(n->child[i]) delNode(n->child[i]);
        }
        delete n;
    }
    
    // Inserts a word into the trie.
    void insert(string word) {
        TrieNode* n = root;
        for(auto ch:word) {
            if(n->child[ch-'a'] == NULL) 
                n->child[ch-'a'] = new TrieNode();
            n = n->child[ch-'a'];
        }
        n->isIn = true;
    }

    // Returns if the word is in the trie.
    bool search(string word) {
        TrieNode* n = root;
        for(auto ch:word) {
            if(n->child[ch-'a'] == NULL) return false;
            n = n->child[ch-'a'];
        }
        return n->isIn;
    }

    // Returns if there is any word in the trie
    // that starts with the given prefix.
    bool startsWith(string prefix) {
        TrieNode* n = root;
        for(auto ch:prefix) {
            if(n->child[ch-'a'] == NULL) return false;
            n = n->child[ch-'a'];
        }
        return true;
    }

private:
    TrieNode* root;
};

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

版权声明:本文为博主原创文章,未经博主允许不得转载。

LeetCode208 Implement Trie (Prefix Tree) Java

题目: Implement a trie with insert, search, and startsWith methods.Note: You may assume that all in...

LeetCode 208: Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs a...

Leetcode 208 Implement Trie (Prefix Tree) 实现字典树 (前缀字典树)

实现一个`Trie字典树`,实现 `insert` `search` `startsWith` 方法。

LeetCode-208 Implement Trie (Prefix Tree)

题目: mplement a trie with insert, search, and startsWith methods. Note: You may assume that all ...

LeetCode 208 Implement Trie (Prefix Tree)

题目描述Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inpu...

Leetcode题解 - 208. Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods. Note: You may assume that all i...

[LeetCode 208] Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods. Note: You may assume that all in...
  • sbitswc
  • sbitswc
  • 2015年08月24日 13:09
  • 567

LeetCode[208] Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods. Note: You may assume that all in...

leetcode 208. Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods. Note: You may assume that all in...

leetcode_208 Implement Trie(Prefix Tree)

题目分析: 实现字典树,包含其插入、查找以及前缀查找等方法。可以假设所有输入都只包含a-z字符。 解题思路: 字典树简介字典树(Trie Tree),又名前缀树,使一种用于快速检索的多叉树。主要用于字...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[leetcode] 208. Implement Trie (Prefix Tree)
举报原因:
原因补充:

(最多只允许输入30个字)