leetcode之Implement Trie (Prefix Tree)

这题就是一个字典树的定义啦，简单的插入，查找和查找以xxx开头的单词，以xxx结尾的肯定没法这样找了。代码如下：

class TrieNode(object):
    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.value = None
        self.children = {}

class Trie(object):

    def __init__(self):
        self.root = TrieNode()

    def insert(self, word):
        """
        Inserts a word into the trie.
        :type word: str
        :rtype: void
        """
        node = self.root
        for w in word:
            if w in node.children:
                node = node.children[w]
            else:
                child = TrieNode()
                node.children[w] = child
                node = child
        node.value = word
        

    def search(self, word):
        """
        Returns if the word is in the trie.
        :type word: str
        :rtype: bool
        """
        node = self.root
        for w in word:
            if w not in node.children:
                return False
            node = node.children[w]
        else:
            if node.value == word:
                return True
            else:
                return False
        

    def startsWith(self, prefix):
        """
        Returns if there is any word in the trie
        that starts with the given prefix.
        :type prefix: str
        :rtype: bool
        """
        node = self.root
        for w in prefix:
            if w not in node.children:
                return False
            node = node.children[w]
        else:
            return True