-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path648 Replace Words.py
93 lines (71 loc) · 2.45 KB
/
648 Replace Words.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
87
88
89
90
91
92
93
#!/usr/bin/python3
"""
In English, we have a concept called root, which can be followed by some other
words to form another longer word - let's call this word successor. For example,
the root an, followed by other, which can form another word another.
Now, given a dictionary consisting of many roots and a sentence. You need to
replace all the successor in the sentence with the root forming it. If a
successor has many roots can form it, replace it with the root with the shortest
length.
You need to output the sentence after the replacement.
Example 1:
Input: dict = ["cat", "bat", "rat"]
sentence = "the cattle was rattled by the battery"
Output: "the cat was rat by the bat"
Note:
The input will only have lower-case letters.
1 <= dict words number <= 1000
1 <= sentence words number <= 1000
1 <= root length <= 100
1 <= sentence words length <= 1000
"""
from typing import List
from collections import defaultdict
class Node:
def __init__(self, chr):
self.chr = chr
self.ended = False
self.children = defaultdict(lambda: None)
class Trie:
def __init__(self):
self.root = Node(None) # dummy
@classmethod
def insert(cls, node, w, i):
if not node:
node = Node(w[i])
if i == len(w) - 1:
node.ended = True
else:
nxt = w[i + 1]
node.children[nxt] = cls.insert(node.children[nxt], w, i + 1)
return node
@classmethod
def search(cls, node, w, i):
if not node:
return
if node.chr != w[i]:
return
if node.ended:
return w[:i+1]
elif i + 1 < len(w):
return cls.search(node.children[w[i + 1]], w, i + 1)
else:
return
class Solution:
def replaceWords(self, dic: List[str], sentence: str) -> str:
trie = Trie()
for word in dic:
root = trie.root
root.children[word[0]] = Trie.insert(root.children[word[0]], word, 0)
ret = []
for word in sentence.split(" "):
for child in trie.root.children.values():
searched = Trie.search(child, word, 0)
if searched:
ret.append(searched)
break
else:
ret.append(word)
return " ".join(ret)
if __name__ == "__main__":
assert Solution().replaceWords(["cat", "bat", "rat"], "the cattle was rattled by the battery") == "the cat was rat by the bat"