leetcode 211. 添加与搜索单词 - 数据结构设计

class Node:
    def __init__(self, c=''):
        self.is_end = False
        self.subNode = []
        self.c = c

    def insert(self, word: str): #构建前缀树
        next = None
        for sb in self.subNode:
            if word[0] == sb.c[0]:
                next = sb
                break
        if not next:
            next = Node(word[0])
            self.subNode.append(next)

        if len(word[1:]):
            next.insert(word[1:])
        else:
            next.is_end = True

    def search(self, word: str) -> bool:
        for n in self.subNode:
            if word[0] == '.' or word[0] == n.c[0]:
                if word[1:]:
                    b = n.search(word[1:])
                    if b: # 找到则不再继续
                        return True
                else:                    
                    if n.is_end:
                        return True

class WordDictionary:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.root = Node()

    def addWord(self, word: str) -> None:
        """
        Adds a word into the data structure.
        """
        self.root.insert(word)

    def search(self, word: str) -> bool:
        """
        Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter.
        """
        res = self.root.search(word)
        if res:
            return True
        else:
            return False

    def print_tree(self, node):
        vec = []
        vec.append(node)
        i = 0

        while i < len(vec):
            j = len(vec)
            cur_level = []
            while i < j:
                for n in vec[i].subNode:
                    vec.append(n)
                    cur_level.append(n.c)
                i += 1
            print(cur_level)