[LintCode] Implement Trie 实现字典树

最新推荐文章于 2022-09-04 17:07:51 发布

转载最新推荐文章于 2022-09-04 17:07:51 发布 · 64 阅读

本文详细介绍了如何使用字典树(前缀树)实现插入、搜索和以前缀开始的方法，并提供了LeetCode上的原题实例，帮助读者理解并掌握字典树的应用。

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

Have you met this question in a real interview?

Example

Note

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

LeetCode上的原题，请参见我之前的博客Implement Trie (Prefix Tree) 实现字典树(前缀树)。

/**
 * Your Trie object will be instantiated and called as such:
 * Trie trie;
 * trie.insert("lintcode");
 * trie.search("lint"); will return false
 * trie.startsWith("lint"); will return true
 */
class TrieNode {
public:
    // Initialize your data structure here.
    TrieNode *child[26];
    bool isWord;
    TrieNode(): isWord(false) {
        for (auto & a : child) a = NULL;
    }
};

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

    // Inserts a word into the trie.
    void insert(string word) {
        TrieNode *p = root;
        for (auto &a : word) {
            int i = a - 'a';
            if (!p->child[i]) p->child[i] = new TrieNode();
            p = p->child[i];
        }
        p->isWord = true;
    }

    // Returns if the word is in the trie.
    bool search(string word) {
        TrieNode *p = root;
        for (auto &a : word) {
            int i = a - 'a';
            if (!p->child[i]) return false;
            p = p->child[i];
        }
        return p->isWord;
    }

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

private:
    TrieNode* root;
};