Trie树(oversimplified python version)

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

转载最新推荐文章于 2025-03-12 23:52:54 发布 · 1k 阅读

PYTHON 专栏收录该内容

56 篇文章

订阅专栏

本文详细介绍了如何使用Python构建一个自定义字典树，并提供了搜索部分匹配字符串的功能。通过实例演示了如何将关键词列表转换为字典树结构，以及如何进行高效的部分匹配查询。

参考网站： http://blog.youkuaiyun.com/psrincsdn/article/details/8158182?reload

#!/usr/bin/env python

import sys, pickle, re

class TrieNode(object):
    def __init__(self):
        self.value = None
        self.children = {}

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

    def add(self, key):
        node = self.root
        for char in key:
            if char not in node.children:
                child = TrieNode()
                node.children[char] = child
                node = child
            else:
                node = node.children[char]
        node.value = key

    def search(self, key):
        '''return all partially matched strings with the input key'''
        node = self.root
        matches = []
        for char in key:
            if char not in node.children:
                break
            node = node.children[char]
            if node.value:
                matches.append(node.value)
        return matches

def gen_trie(input_file, output_file):
    trie = Trie()
    with open(input_file) as f:
        for line in f:
            line = line.strip()
            trie.add(line)
    with open(output_file, 'wb') as f:
        pickle.dump(trie, f)

if __name__ == '__main__':
    gen_trie('your_key_list', 'output_trie_file')