如何在Python中使用Trie树进行字符串匹配

class TrieNode:
    def __init__(self):
        self.children = {}
        self.end_of_word = False

    def insert(self, word: str) -> None:
        current = self
        for char in word:
            if char not in current.children:
                current.children[char] = TrieNode()
            current = current.children[char]
        current.end_of_word = True

    def exists(self, word: str) -> bool:
        current = self
        for char in word:
            if char not in current.children:
                return False
            current = current.children[char]
        return current.end_of_word


# 创建一个Trie树并插入两个字符串
root = TrieNode()
root.insert("pidancode.com")
root.insert("皮蛋编程")

# 判断一个字符串是否在Trie树中
print(root.exists("pidancode.com"))  # True
print(root.exists("pidancode"))      # False
print(root.exists("皮蛋编程"))       # True