《LeetCode笔记81》：实现 Trie (前缀树)

题目：

实现一个 Trie (前缀树)，包含 insert, search, 和 startsWith 这三个操作。

示例:

Trie trie = new Trie();

trie.insert("apple");
trie.search("apple");   // 返回 true
trie.search("app");     // 返回 false
trie.startsWith("app"); // 返回 true
trie.insert("app");   
trie.search("app");     // 返回 true

说明:

• 你可以假设所有的输入都是由小写字母 a-z 构成的。
• 保证所有输入均为非空字符串。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/implement-trie-prefix-tree

方法一：

构建树，利用字典存储子节点，设置标志位判断节点是否是一个单词的末尾。

class Node:
    def __init__(self, val=None):
        self.val = val
        self.next = {}
        self.isend = 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.
        """
        head = self.root
        for i in word:
            if i in head.next.keys():
                head = head.next[i]
            else:
                new_Node = Node(i)
                head.next[i] = new_Node
                head = head.next[i]
        head.isend = True       

    def search(self, word: str) -> bool:
        """
        Returns if the word is in the trie.
        """
        head = self.root
        for i in word:
            if i in head.next.keys():
                head = head.next[i]
            else:
                return False
        return head.isend


    def startsWith(self, prefix: str) -> bool:
        """
        Returns if there is any word in the trie that starts with the given prefix.
        """
        head = self.root
        for i in prefix:
            if i in head.next.keys():
                head = head.next[i]
            else:
                return False
        return True