-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day-14_Implement_a_trie.py
76 lines (60 loc) · 1.73 KB
/
Day-14_Implement_a_trie.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
'''
Implement a trie with insert, search, and startsWith methods.
Example:
Trie trie = new Trie();
trie.insert("apple");
trie.search("apple"); // returns true
trie.search("app"); // returns false
trie.startsWith("app"); // returns true
trie.insert("app");
trie.search("app"); // returns true
Note:
You may assume that all inputs are consist of lowercase letters a-z.
All inputs are guaranteed to be non-empty strings.
'''
class Trie:
def __init__(self):
"""
Initialize your data structure here.
"""
self.head={}
def insert(self, word: str) -> None:
"""
Inserts a word into the trie.
"""
curr=self.head
for i in word:
if i not in curr:
curr[i]={}
curr=curr[i]
curr['*']=True
def search(self, word: str) -> bool:
"""
Returns if the word is in the trie.
"""
curr=self.head
for i in word:
if i not in curr:
return False
else:
curr=curr[i]
if '*' in curr:
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.
"""
curr=self.head
for i in prefix:
if i not in curr:
return False
else:
curr=curr[i]
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)