-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTrie.py
86 lines (58 loc) · 2.03 KB
/
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
77
78
79
80
81
82
83
84
85
86
class TrieNode:
def __init__(self):
self.children = [None]*26
self.isEndOfWord = False
class Trie:
def __init__(self):
"""
Initialize your data structure here.
"""
self.root = self.getNode()
def getNode(self):
return TrieNode()
def _charToIndex(self,ch):
return ord(ch)-ord('a')
def insert(self, word: str) -> None:
"""
Inserts a word into the trie.
"""
# check if present otherwise add
pCrawl = self.root
length = len(word)
for level in range(length):
index = self._charToIndex(word[level])
if not pCrawl.children[index]:
pCrawl.children[index] = self.getNode()
pCrawl = pCrawl.children[index]
pCrawl.isEndOfWord = True
def search(self, word: str) -> bool:
"""
Returns if the word is in the trie.
"""
pCrawl = self.root
length = len(word)
for level in range(length):
index = self._charToIndex(word[level])
if not pCrawl.children[index]:
return False
pCrawl = pCrawl.children[index]
return pCrawl!=None and pCrawl.isEndOfWord
def startsWith(self, prefix: str) -> bool:
"""
Returns if there is any word in the trie that starts with the given prefix.
"""
pCrawl = self.root
length = len(prefix)
k = 0
for level in range(length):
index = self._charToIndex(prefix[level])
if not pCrawl.children[index]:
return False
pCrawl = pCrawl.children[index]
k+=1
return k==length
# 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)