648. 单词替换
难度中等
在英语中,我们有一个叫做 词根(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.0:
(1)map<int,vector> Msg,字母信息:长度,在原数组中的下标。
(2)unordered_map<char,Msg> Letters,首字母和字母信息
(3)将原数组中的信息转移到Letters中
(4)遍历sentence中的前n个字符组成的单词,并在哈希表Letters中检索
1)在对字符串进行处理的时候使用双指针,指向每次遍历的字符串的首部和尾部(空格)
(5)不在原string上做修改,每次覆盖都会导致大量的元素移动。设置新的string来存储结果
代码1.0:
struct Msg {
map<int, vector<int>> msg;
Msg() :msg() {};
};
class Solution {
public:
string replaceWords(vector<string>& dictionary, string sentence) {
string ans;
unordered_map<char, Msg> Letters;
for (int i = 0; i < dictionary.size(); ++i) {
Letters[*dictionary[i].begin()].msg[dictionary[i].size()].push_back(i);
}
auto left = sentence.begin();
auto right = find(sentence.begin(), sentence.end(), ' ');
while (right <= sentence.end()) {
bool isFind = false;
//如果找到该首字母
if (Letters.find(*left) != Letters.end()) {
auto& msg = Letters[*left].msg;
//从长度最小的词根开始遍历
for (const auto& i : msg) {
if (left + i.first - 1 >= right || isFind) break;
string str(left, left + i.first);
for (const auto& j : i.second) {
//找到最小元素
if (isFind) break;
if (dictionary[j] == str) {
ans.append(str+ " ");
isFind = true;
}
}
}
}
//没有找到该元素
if (!isFind) ans.append(string(left, right) + " ");
if (right != sentence.end()) {
left = right + 1;
right = find(left, sentence.end(), ' ');
}
else {
break;
}
}
ans.erase(ans.end() - 1);
return ans;
}
};
不看题解一口气完成!