-
Notifications
You must be signed in to change notification settings - Fork 0
/
208. Implement Trie (Prefix Tree).py
52 lines (43 loc) · 1.24 KB
/
208. Implement Trie (Prefix Tree).py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
class TreeNode:
def __init__(self):
self.isWord = False
self.child = collections.defaultdict(TreeNode)
class Trie:
def __init__(self):
"""
Initialize your data structure here.
"""
self.root = TreeNode()
def insert(self, word: str) -> None:
"""
Inserts a word into the trie.
"""
cur = self.root
for s in word:
cur = cur.child[s]
cur.isWord = True
def search(self, word: str) -> bool:
"""
Returns if the word is in the trie.
"""
cur = self.root
for s in word:
cur = cur.child.get(s)
if not cur:
return False
return cur.isWord
def startsWith(self, prefix: str) -> bool:
"""
Returns if there is any word in the trie that starts with the given prefix.
"""
cur = self.root
for s in prefix:
cur = cur.child.get(s)
if not cur:
return False
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)