class Trie:
def __init__(self):
self.children = [None] * 26
self.isEnd = False
def searchPrefix(self, prefix):
node = self
for ch in prefix:
ch = ord(ch) - ord("a")
if not node.children[ch]:
return None
node = node.children[ch]
return node
# 根据插入的word构造字典树
def insert(self, word):
node = self
for ch in word:
ch = ord(ch) - ord("a")
if not node.children[ch]:
node.children[ch] = Trie()
node = node.children[ch]
node.isEnd = True
def search(self, word):
node = self.searchPrefix(word)
return node is not None and node.isEnd
def startsWith(self, prefix):
return self.searchPrefix(prefix) is not None
LeetCode 208 实现 Trie (前缀树)
最新推荐文章于 2024-07-19 22:53:00 发布