LeetCode 208. 实现 Trie (前缀树)-CSDN博客

本文链接：https://blog.csdn.net/qq_44190767/article/details/136737839

本文介绍了如何在C++中实现Trie（前缀树）数据结构，包括构造、插入、搜索和判断是否以特定前缀开头的方法，以及其实现细节和操作特性。

摘要由CSDN通过智能技术生成

208. 实现 Trie (前缀树)https://leetcode.cn/problems/implement-trie-prefix-tree/description/?envType=study-plan-v2&envId=top-100-liked前缀树确实是树，但操作起来更像链表。

struct TrieNode {
    bool isWord = false;
    TrieNode* children[26] = {nullptr};
};


class Trie {
public:
    TrieNode* root;
    Trie() {
        root = new TrieNode();
    }
    
    void insert(string word) {
        TrieNode *p = root;
        for (char c : word) {
            if (p -> children[c - 'a'] == nullptr) {
                p -> children[c - 'a'] = new TrieNode;
            }
            p = p -> children[c - 'a'];
        }
        p -> isWord = true;
    }

    bool search(string word) {
        TrieNode *p = root;
        for (char c : word) {
            if (p -> children[c - 'a'] == nullptr) {
                return false;
            }
            p = p -> children[c - 'a'];
        }
        return p -> isWord;
    }

    bool startsWith(string prefix) {
        TrieNode *p = root;
        for (char c : prefix) {
            if (p -> children[c - 'a'] == nullptr) {
                return false;
            }
            p = p -> children[c - '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);
 */