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");

Leetcode 208: Implement Trie (Prefix Tree)

Implement Trie (Prefix Tree) Total Accepted: 601 Total Submissions: 2396 Implement a tri...
  • xudli
  • xudli
  • 2015年05月09日 06:59
  • 3984

LeetCode 208: Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs a...
  • sunao2002002
  • sunao2002002
  • 2015年06月27日 15:32
  • 3214

LeetCode208:Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs a...
  • u012501459
  • u012501459
  • 2015年07月03日 15:44
  • 809

Implement Trie (Prefix Tree)

Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs a...
  • u010786672
  • u010786672
  • 2015年05月08日 21:32
  • 872

[LeetCode]Implement Trie(Prefix Tree),解题报告

目录目录 概述 Trie树基本实现 定义Trie树节点 添加操作 查询word是否在Trie树中 AC完整代码概述Trie树,又称为字典树、单词查找树或者前缀树,是一种用于快速检索的多叉数结构。例如,...
  • zinss26914
  • zinss26914
  • 2015年05月15日 14:12
  • 4559

[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
  • 616

LeetCode208 Implement Trie (Prefix Tree) Java

题目: Implement a trie with insert, search, and startsWith methods.Note: You may assume that all in...
  • l294265421
  • l294265421
  • 2016年04月22日 21:59
  • 563

leetcode:Trie:Implement Trie (Prefix Tree)(208)

Implement a trie with insert, search, and startsWith methods.class TrieNode { public: char v...
  • mijian1207mijian
  • mijian1207mijian
  • 2016年08月31日 15:01
  • 79

Implement Trie (Prefix Tree) LeetCode Java

Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs a...
  • zuoyexingchennn
  • zuoyexingchennn
  • 2015年06月01日 19:50
  • 200

leetcode[208]:Implement Trie (Prefix Tree)

【题目】 Implement a trie with insert, search, and startsWith methods.Note: You may assume that all i...
  • sunyangwei1993
  • sunyangwei1993
  • 2016年08月20日 15:06
  • 288
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode 208 Implement Trie (Prefix Tree)
举报原因:
原因补充:

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