Python 字典树的应用调研与对比分析

class TrieNode:
    def __init__(self):
        self.children = [None] * 26    # 26个子节点，一个字符对应一个子节点
        self.is_end = False    # 标记该节点是否为字符串的结尾

class Trie:
    def __init__(self):
        self.root = TrieNode()    # 初始化根节点

    def insert(self, word: str) -> None:
        node = self.root
        for c in word:
            index = ord(c) - ord('a')
            if not node.children[index]:
                node.children[index] = TrieNode()
            node = node.children[index]
        node.is_end = True

    def search(self, word: str) -> bool:
        node = self.root
        for c in word:
            index = ord(c) - ord('a')
            if not node.children[index]:
                return False
            node = node.children[index]
        return node.is_end

    def startsWith(self, prefix: str) -> bool:
        node = self.root
        for c in prefix:
            index = ord(c) - ord('a')
            if not node.children[index]:
                return False
            node = node.children[index]
        return True


# 测试字典树
trie = Trie()
trie.insert("pidancode.com")
trie.insert("皮蛋编程")
print(trie.search("pidancode.com"))    # True
print(trie.startsWith("pidan"))    # True
print(trie.startsWith("pi")))    # True
print(trie.search("pida"))    # False