Leetcode648单词替换(字典树应用)
C++实现
一、问题描述
在英语中,我们有一个叫做 词根(root)的概念,它可以跟着其他一些词组成另一个较长的单词——我们称这个词为 继承词(successor)。例如,词根an,跟随着单词 other(其他),可以形成新的单词 another(另一个)。
现在,给定一个由许多词根组成的词典和一个句子。你需要将句子中的所有继承词用词根替换掉。如果继承词有许多可以形成它的词根,则用最短的词根替换它。
你需要输出替换之后的句子。
示例1:
输入: dict(词典) = [“cat”, “bat”, “rat”]
sentence(句子) = “the cattle was rattled by the battery”
输出: “the cat was rat by the bat”
注:
输入只包含小写字母。
1 <= 字典单词数 <=1000
1 <= 句中词语数 <= 1000
1 <= 词根长度 <= 100
1 <= 句中词语长度 <= 1000
二、解决思路
将所有词根放入字典树中,遍历整个句子,依次与字典树中的词根相匹配即可。
2.1 词根字典树结构体
struct TrieTree{
bool isEnd;
TrieTree* next[26];
// map<char, TrieTree*> next;
TrieTree(){
this->isEnd = false;
memset(this->next,0,sizeof(this->next));
}
};
2.1 构建词根字典树
TrieTree* insert(vector<string>& dict){
TrieTree* root = new TrieTree();
TrieTree* node = root;
for(int i=0; i < size(dict); i++){
for(char c : dict[i]){
if(node->next[c-'a']==nullptr) node->next[c-'a'] = new TrieTree();
node = node->next[c-'a'];
}
node->isEnd = true;
node = root;
}
return root;
}
2.2 查找词根
string findPrefix(TrieTree* root, string word){
string res = "";›
TrieTree* node = root;
for(int i=0;i<word.size(); i++){
char c = word[i];
if(node->next[c-'a']==nullptr)return word;
res.push_back(c);
node = node->next[c-'a'];
if(node->isEnd)return res;
}
return res;
}
2.3 遍历句子,前缀查找
string replace(TrieTree* root, string sentence){
istringstream iss(sentence);
string res = "", temp = "";
while(iss>>temp){
if(!res.empty()) res += " ";
res+=findPrefix(root, temp);
}
return res;
}
三、全部代码及结果
3.1 全部代码
class Solution {
private:
struct TrieTree{
bool isEnd;
TrieTree* next[26];
// map<char, TrieTree*> next;
TrieTree(){
this->isEnd = false;
memset(this->next,0,sizeof(this->next));
}
};
public:
string replaceWords(vector<string>& dict, string sentence) {
TrieTree* root = insert(dict);
string res = replace(root,sentence);
return res;
}
TrieTree* insert(vector<string>& dict){
TrieTree* root = new TrieTree();
TrieTree* node = root;
for(int i=0; i < size(dict); i++){
for(char c : dict[i]){
if(node->next[c-'a']==nullptr) node->next[c-'a'] = new TrieTree();
node = node->next[c-'a'];
}
node->isEnd = true;
node = root;
}
return root;
}
string findPrefix(TrieTree* root, string word){
string res = "";›
TrieTree* node = root;
for(int i=0;i<word.size(); i++){
char c = word[i];
if(node->next[c-'a']==nullptr)return word;
res.push_back(c);
node = node->next[c-'a'];
if(node->isEnd)return res;
}
return res;
}
string replace(TrieTree* root, string sentence){
istringstream iss(sentence);
string res = "", temp = "";
while(iss>>temp){
if(!res.empty()) res += " ";
res+=findPrefix(root, temp);
}
return res;
}
};