LeetCode 208 Implement Trie (Prefix Tree)

原创 2015年07月09日 16:39:05

Implement a trie with insert, search, and startsWith methods.

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

这个题比较简单,就是实现一个单词树,单词树的相关资料可以参考:http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html
感觉唯一需要注意的就是插入字符串”abc”,搜索”ab”是不存在的,但是再一次插入”ab”之后,需要可以搜索到”ab”。
直接上代码了:

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

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

    // Inserts a word into the trie.
    void insert(string word) {
        TrieNode *cur = root;
        for(int i = 0; i < word.length(); i++)
        {
            int curidx = word[i] - 'a';
            if(cur->children[curidx] == NULL)
            {
                cur->children[curidx] = new TrieNode();
            }
            cur = cur->children[curidx];
        }
        cur->contain_self = true;
    }

    // Returns if the word is in the trie.
    bool search(string word) {
        TrieNode *cur = root;
        for(int i = 0; i < word.length(); i++)
        {
            int curidx = word[i] - 'a';
            if(cur->children[curidx] == NULL)
                return false;
            else
                cur = cur->children[curidx];
        }
        return cur->contain_self;
    }

    // Returns if there is any word in the trie
    // that starts with the given prefix.
    bool startsWith(string prefix) {
        TrieNode *cur = root;
        for(int i = 0; i < prefix.length(); i++)
        {
            int curidx = prefix[i] - 'a';
            if(cur->children[curidx] == NULL)
                return false;
            else
                cur = cur->children[curidx];
        }
        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
  • 555

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个字)