Trie树python实现

2023年10月16日 426次阅读 来源: Trie树 
class TrieNode:
    def __init__(self):
        self.children = {}
        self.flag = None
class Trie:
    def __init__(self):
        self.root = TrieNode()
    def add(self,s):
        curNode = self.root
        for i in s:
            if curNode.children.get(i) is None:
                newNode = TrieNode()
                curNode.children[i] = newNode
            curNode = curNode.children[i]
        curNode.flag = 1
    def search_node(self,s):
        curNode = self.root
        for i in s:
            if curNode.children.get(i) is None:
                return None
            else:
                curNode = curNode.children.get(i)
        if curNode.flag == 1:
            return curNode
    def search(self,s):
        x = self.search_node(s)
        return s if x is not None else None
    def remove(self,s):
        x = self.search_node(s)
        if x is not None:
            x.flag = None

if __name__ == '__main__':
    x = Trie()
    x.add('str')
    x.add('str1')
    x.remove('str')
    print x.search('str1')
    原文作者：Trie树
    原文地址: https://blog.csdn.net/github_34375011/article/details/50949191
    本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系博主进行删除。
点赞