LeetCode208 实现 Trie (前缀树)
前缀树模板
class Trie:
def __init__(self):
self.children = [None] * 26
self.end = False
def insert(self, word: str) -> None:
node = self
for c in word:
c = ord(c) - ord('a')
if not node.children[c]: node.children[c] = Trie()
node = node.children[c]
node.end = True
def search(self, word: str) -> bool:
node = self
for c in word:
c = ord(c) - ord('a')
if not node.children[c]: return False
node = node.children[c]
return node.end
def startsWith(self, prefix: str) -> bool:
node = self
for c in prefix:
c = ord(c) - ord('a')
if not node.children[c]: return False
node = node.children[c]
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)