链接
https://leetcode-cn.com/problems/implement-trie-prefix-tree/
前言
题目
Trie(发音类似 “try”)或者说前缀树是一种树形数据结构,用于高效地存储和检索字符串数据集中的键。这一数据结构有相当多的应用情景,例如自动补完和拼写检查。
请你实现 Trie 类:
Trie()
初始化前缀树对象。void insert(String word)
向前缀树中插入字符串 word 。boolean search(String word)
如果字符串 word 在前缀树中,返回 true(即,在检索之前已经插入);否则,返回 false 。boolean startsWith(String prefix)
如果之前已经插入的字符串 word 的前缀之一为 prefix ,返回 true ;否则,返回 false 。
示例:
输入
["Trie", "insert", "search", "search", "startsWith", "insert", "search"]
[[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]]
输出
[null, null, true, false, true, null, true]
解释
Trie trie = new Trie();
trie.insert("apple");
trie.search("apple"); // 返回 True
trie.search("app"); // 返回 False
trie.startsWith("app"); // 返回 True
trie.insert("app");
trie.search("app"); // 返回 True
提示
1 <= word.length, prefix.length <= 2000
word
和prefix
仅由小写英文字母组成insert、search 和 startsWith
调用次数总计不超过3 * 10^4
次
关键
本人思路
- 有地方输出错误
- 还没理解前缀树的意思
class Trie:
def __init__(self):
"""
Initialize your data structure here.
"""
self.tree = []
def insert(self, word: str) -> None:
"""
Inserts a word into the trie.
"""
self.tree.append(word)
def search(self, word: str) -> bool:
"""
Returns if the word is in the trie.
"""
if word in self.tree:
return True
else:
return False
def startsWith(self, prefix: str) -> bool:
"""
Returns if there is any word in the trie that starts with the given prefix.
"""
if not self.tree:
return False
for i in self.tree:
if prefix in i:
return True
else:
return False
思路1
- 不好理解
class Trie:
def __init__(self):
"""
Initialize your data structure here.
"""
self.dic = {}
def insert(self, word: str) -> None:
"""
Inserts a word into the trie.
"""
t = self.dic
for w in word:
if w not in t:
t[w] = {}
t = t[w]
t['end'] = True
def search(self, word: str) -> bool:
"""
Returns if the word is in the trie.
"""
t = self.dic
for w in word:
if w not in t:
return False
t = t[w]
return 'end' in t
def startsWith(self, prefix: str) -> bool:
"""
Returns if there is any word in the trie that starts with the given prefix.
"""
t = self.dic
for w in prefix:
if w not in t:
return False
t = t[w]
return True
疑问
参考
[1] 208. 实现 Trie (前缀树),字典嵌套 or 创建TrieNode
[2] 208. 实现 Trie (前缀树):本质上是字典按字母迭代