题目链接
题目描述
在英语中,我们有一个叫做 词根(root) 的概念,可以词根后面添加其他一些词组成另一个较长的单词——我们称这个词为 继承词(successor)。例如,词根an,跟随着单词 other(其他),可以形成新的单词 another(另一个)。
现在,给定一个由许多词根组成的词典 dictionary 和一个用空格分隔单词形成的句子 sentence。你需要将句子中的所有继承词用词根替换掉。如果继承词有许多可以形成它的词根,则用最短的词根替换它。
你需要输出替换之后的句子。
示例 1:
输入:dictionary = ["cat","bat","rat"], sentence = "the cattle was rattled by the battery"
输出:"the cat was rat by the bat"
示例 2:输入:dictionary = ["a","b","c"], sentence = "aadsfasf absbs bbab cadsfafs"
输出:"a a b c"
提示:
1 <= dictionary.length <= 1000
1 <= dictionary[i].length <= 100
dictionary[i] 仅由小写字母组成。
1 <= sentence.length <= 10^6
sentence 仅由小写字母和空格组成。
sentence 中单词的总量在范围 [1, 1000] 内。
sentence 中每个单词的长度在范围 [1, 1000] 内。
sentence 中单词之间由一个空格隔开。
sentence 没有前导或尾随空格。
解题思路
前缀树,见剑指 Offer II 063. 替换单词_qbnmm的博客-CSDN博客
代码
Python
class Trie:
def __init__(self):
self.childs = [None for _ in range(26)]
self.isEnd = False
class Solution:
def replaceWords(self, dictionary: list[str], sentence: str) -> str:
root = Trie()
for word in dictionary:
node = root
for i in range(len(word)):
idx = ord(word[i]) - ord('a')
if node.childs[idx] is None:
node.childs[idx] = Trie()
node = node.childs[idx]
node.isEnd = True
ans = []
for word in sentence.split():
node = root
res = word
i = 0
while i < len(word):
idx = ord(word[i]) - ord('a')
if node.childs[idx] is None:
i = -1
break
node = node.childs[idx]
if node.isEnd:
break
i += 1
if i == -1:
ans.append(res)
else:
ans.append(res[:i + 1])
return " ".join(ans)