树 - 标签 - 豆浆小屋https://soybeanmilk.netlify.app/tags/%E6%A0%91/树 - 标签 - 豆浆小屋Hugo -- gohugo.iozh-CNThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.Thu, 20 Aug 2026 00:00:00 +0000字典树（Trie）https://soybeanmilk.netlify.app/snippets/trie/Thu, 20 Aug 2026 00:00:00 +0000作者https://soybeanmilk.netlify.app/snippets/trie/字典树（Trie）是一种树形数据结构，用于高效地存储和检索字符串数据集。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

struct TrieNode {
    TrieNode* children[26];
    bool isEnd;
    
    TrieNode() : isEnd(false) {
        for (int i = 0; i < 26; i++) {
            children[i] = nullptr;
        }
    }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

void insert(string word) {
    TrieNode* node = root;
    for (char c : word) {
        if (!node->children[c - 'a']) {
            node->children[c - 'a'] = new TrieNode();
        }
        node = node->children[c - 'a'];
    }
    node->isEnd = true;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

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

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

bool startsWith(string prefix) {
    TrieNode* node = root;
    for (char c : prefix) {
        if (!node->children[c - 'a']) {
            return false;
        }
        node = node->children[c - 'a'];
    }
    return true;
}
  • 自动补全
  • 拼写检查
  • IP路由表
  • 词频统计
]]>