Python学习笔记：Trie Tree的实现

最新推荐文章于 2025-03-12 23:52:54 发布

JTCC

最新推荐文章于 2025-03-12 23:52:54 发布

阅读量1.5k

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 文章标签： python

本文链接：https://blog.youkuaiyun.com/lsj308/article/details/39932743

Python 专栏收录该内容

24 篇文章

订阅专栏

本文深入探讨了Trie树的概念、实现原理及其在不同场景的应用。通过具体代码实例展示了如何构建Trie树并进行搜索操作，同时分析了Trie树在解决字符串匹配问题上的优势。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

# Trie Tree 1

class TrieTree(object):
    def __init__(self, key=None, size=0):
        self.key = key
        self.size = size
        self.children = []
    def insert(self, word):
        node = self
        for i in range(len(word)):
            target = word[i]
            found = False
            node.size += 1
            for child in node.children:
                if child.key == target:
                    found = True
                    node = child
                    break
            if not found:
                child = TrieTree(target)
                node.children.append(child)
                node = child
    def search(self, word):
        node = self
        for i in range(len(word)):
            target = word[i]
            found = False
            for child in node.children:
                if child.key == target:
                    found = True
                    node = child
                    break
            if not found:
                return 0
        return node.size

def test():
    tt = TrieTree()
    tt.insert('babaab')
    tt.insert('babbbaaaa')
    tt.insert('abba')
    tt.insert('aaaaabaa')
    tt.insert('babaababb')
    print(tt.search('babb'))
    print(tt.search('bab'))
    print(tt.search('abb'))
    print(tt.search('aaaaa'))
    print(tt.search('babbbb'))

# Trie Tree 2

class TrieTree(object):
    def __init__(self):
        self.size = 0
        self.children = [None] * 26
    def insert(self, word):
        node = self
        for w in word:
            index = ord(w) - 97
            node.size += 1
            if node.children[index] == None:
                node.children[index] = TrieTree()
            node = node.children[index]
    def search(self, word):
        node = self
        for w in word:
            index = ord(w) - 97
            if node.children[index] == None:
                return 0
            else:
                node = node.children[index]
        return node.size

参考#1014 : Trie树