未验证 提交 37063d09 编写于 作者: K KEQI HUANG 提交者: GitHub

Update 208._implement_trie_(prefix_tree).md

上级 eb416964
......@@ -56,10 +56,11 @@ class Trie(object):
:rtype: bool
"""
node = self.root
for letter in word:
node = node.childs.get(letter)
if node is None:
for i in word:
child = node.childs.get(i)
if child is None:
return False
node = child
return node.isWord
......@@ -72,9 +73,10 @@ class Trie(object):
"""
node = self.root
for letter in prefix:
node = node.childs.get(letter)
if node is None:
child = node.childs.get(letter)
if child is None:
return False
node = child
return True
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册