Update 208._implement_trie_(prefix_tree).md

208._implement_trie_(prefix_tree).md

-###208. Implement Trie (Prefix Tree)
-
-题目:
-
-<https://leetcode.com/problems/implement-trie-prefix-tree/>
-
-
-难度:
-
-Medium
-
-这个Python实现也太精美了吧，谷歌复写之
-
-然后还unlock了一个solution，to read
-
-Trie整个都需要 to read，精美，可爱😊
-
-
-
-
+### 208. Implement Trie (Prefix Tree)
+
+题目:
+
+<https://leetcode.com/problems/implement-trie-prefix-tree/>
+
+
+难度:
+
+Medium
+
+这个Python实现也太精美了吧，谷歌复写之
+
+然后还unlock了一个solution，to read
+
+Trie整个都需要 to read，精美，可爱😊
+
+
+
+
+```python
+class TrieNode(object):
+    def __init__(self):
+        """
+        Initialize your data structure here.
+        """
+        self.childs = dict()
+        self.isWord = False
+        
+        
+
+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 letter in word:
+            child = node.childs.get(letter)
+            if child is None:
+                child = TrieNode()
+                node.childs[letter] = child
+            node = child
+        node.isWord = True
+
+    def search(self, word):
+        """
+        Returns if the word is in the trie.
+        :type word: str
+        :rtype: bool
+        """
+        node = self.root
+        for letter in word:
+            node = node.childs.get(letter)
+            if node is None:
+                return False
+        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
+        """
+        node = self.root
+        for letter in prefix:
+            node = node.childs.get(letter)
+            if node is None:
+                return False
+        return True
+        
+
+# Your Trie object will be instantiated and called as such:
+# trie = Trie()
+# trie.insert("somestring")
+# trie.search("key")
+        
 ```
-class TrieNode(object):
-    def __init__(self):
-        """
-        Initialize your data structure here.
-        """
-        self.childs = dict()
-        self.isWord = False
-        
-        
-
-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 letter in word:
-            child = node.childs.get(letter)
-            if child is None:
-                child = TrieNode()
-                node.childs[letter] = child
-            node = child
-        node.isWord = True
-
-    def search(self, word):
-        """
-        Returns if the word is in the trie.
-        :type word: str
-        :rtype: bool
-        """
-        node = self.root
-        for letter in word:
-            node = node.childs.get(letter)
-            if node is None:
-                return False
-        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
-        """
-        node = self.root
-        for letter in prefix:
-            node = node.childs.get(letter)
-            if node is None:
-                return False
-        return True
-        
-
-# Your Trie object will be instantiated and called as such:
-# trie = Trie()
-# trie.insert("somestring")
-# trie.search("key")
-        
-```
-
+