leetcode208. 实现 Trie (前缀树)

class Node:
    def __init__(self, c=''):
        self.is_end = False
        self.subNode = []
        self.c = c
    
    def insert(self, word: str):
        flag = False  
        next = None          
        for sb in self.subNode:
            if word[0] == sb.c[0]:
                flag = True
                next = sb
                break

        if not flag:
            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] == n.c[0]:
                if word[1:]:
                    return n.search(word[1:])
                else:
                    return n.is_end
        return False

    def startsWith(self, word: str) -> bool:
        for n in self.subNode:
            if word[0] == n.c[0]:
                if word[1:]:
                    return n.startsWith(word[1:])
                else:
                    return True
        return False

class Trie:

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

    def insert(self, word: str) -> None:
        """
        Inserts a word into the trie.
        """
        self.root.insert(word)

    def search(self, word: str) -> bool:
        """
        Returns if the word is in the trie.
        """
        return self.root.search(word)

    def startsWith(self, prefix: str) -> bool:
        """
        Returns if there is any word in the trie that starts with the given prefix.
        """
        return self.root.startsWith(prefix)
    # 分层打印
    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)