Leetcode 208 Python

解题思路：定义一个新的节点类型，TrieNode，其包含一个标记变量，标记是否可能为最后一个节点，且包含一个大小为26的数组。在Trie中，实现包含Trie节点的多叉树即可。

class TrieNode(object):

    def __init__(self, s):
        """
        Initialize your data structure here.
        """
        self.val = s
        self.isWord = False
        self.next = [None for i in range(26)]

class Trie(object):

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.TrieNode = TrieNode('')


    def insert(self, word):
        """
        Inserts a word into the trie.
        :type word: str
        :rtype: void
        """
        node = self.TrieNode
        for w in word:
            if node.next[ord(w)-ord('a')] is None:
                node.next[ord(w)-ord('a')] = TrieNode(w)
            node = node.next[ord(w)-ord('a')]
        node.isWord = True


    def search(self, word):
        """
        Returns if the word is in the trie.
        :type word: str
        :rtype: bool
        """
        if word == '':
            return True
        node = self.TrieNode
        for w in word:
            print node.next[25]
            if node.next[ord(w)-ord('a')] is None:
                return False
            node = node.next[ord(w)-ord('a')]
        return node.isWord



    def startsWith(self, prefix):
        """
        Returns if there is any word in the trie that starts with the given prefix.
        :type prefix: str
        :rtype: bool
        """
        if prefix == '':
            return True
        node = self.TrieNode
        for w in prefix:
            if node.next[ord(w)-ord('a')] is None:
                return False
            node = node.next[ord(w)-ord('a')]
        return True


# Your Trie object will be instantiated and called as such:
# obj = Trie()
# obj.insert(word)
# param_2 = obj.search(word)
# param_3 = obj.startsWith(prefix)