题目描述:
在英语中,我们有一个叫做 词根(root)的概念,它可以跟着其他一些词组成另一个较长的单词——我们称这个词为 继承词(successor)。例如,词根an,跟随着单词 other(其他),可以形成新的单词 another(另一个)。
现在,给定一个由许多词根组成的词典和一个句子。你需要将句子中的所有继承词用词根替换掉。如果继承词有许多可以形成它的词根,则用最短的词根替换它。
你需要输出替换之后的句子。
示例 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”
示例 3:
输入:dictionary = [“a”, “aa”, “aaa”, “aaaa”], sentence = “a aa a aaaa aaa aaa aaa aaaaaa bbb baba ababa”
输出:“a a a a a a a a bbb baba a”
示例 4:
输入:dictionary = [“catt”,“cat”,“bat”,“rat”], sentence = “the cattle was rattled by the battery”
输出:“the cat was rat by the bat”
示例 5:
输入:dictionary = [“ac”,“ab”], sentence = “it is abnormal that this solution is accepted”
输出:“it is ab that this solution is ac”
提示:
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 没有前导或尾随空格。
方法1:
主要思路:解题链接汇总
(1)先将字典内的字符串使用长度进行升序排序;
(2)然后将句子中的每个单词提取出来,判读其前缀是否是某个字典内的单词;
class Solution {
public:
string replaceWords(vector<string>& dictionary, string sentence) {
sort(dictionary.begin(),dictionary.end(),[](string&lhs,string&rhs){//使用长度进行排序
return lhs.size()<rhs.size();
});
string res;
int index=0;
while(index<sentence.size()){
while(index<sentence.size()&&sentence[index]==' '){//去除空格
++index;
}
if(index==sentence.size()){
break;
}
int tmp_idnex=index;
//提取当前单词
while(tmp_idnex<sentence.size()&&sentence[tmp_idnex]!=' '){
++tmp_idnex;
}
string cur_word=sentence.substr(index,tmp_idnex-index);
index=tmp_idnex;
//判读当前单词的前缀是否存在字典中
for(int i=0;i<dictionary.size()&&dictionary[i].size()<cur_word.size();++i){
if(cur_word.substr(0,dictionary[i].size())==dictionary[i]){
cur_word=dictionary[i];//若在,更换为当前的单词
break;
}
}
//添加分割的空格
if(!res.empty()){
res+=" ";
}
res+=cur_word;
}
return res;
}
};