一行代码构建没有重复前缀的字典

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

class Trie:
    def __init__(self):
        self.root = TrieNode()

    def insert(self, word):
        node = self.root
        for char in word:
            if char not in node.children:
                node.children[char] = TrieNode()
            node = node.children[char]
        node.is_end_of_word = True

    def search(self, word):
        node = self.root
        prefix = ""
        for char in word:
            if char not in node.children:
                return prefix
            prefix += char
            node = node.children[char]
        return prefix

# 示例用法
trie = Trie()
words = ["apple", "banana", "application", "book", "cat"]
for word in words:
    trie.insert(word)

word = "app"
prefix = trie.search(word)
print("输入的单词：", word)
print("没有重复前缀的字典：", prefix)