解题思路:
本质上是解决一个双向映射的问题,即对于每个word和pattern中的每个字母,都要双向映射,比如体重的mee和abb,必须e和b对应,且b和e对应,这就需要构造两个数组来分别存储word中对应字母下标和pattern中对应字母下标的映射,以及pattern中对应字母下标与word中对应字母下标的映射,如果都能对应上,则word满足匹配模式,放入res数组中,否则直接break,代码如下:
class Solution {
public:
vector<string> findAndReplacePattern(vector<string>& words, string pattern) {
vector<string> res;
int len = pattern.size();
for(auto& word : words) {
vector<int> reflect1(26, -1);
vector<int> reflect2(26, -1);
int flag = true;
for(int i = 0; i < len; i ++) {
if(reflect1[word[i] - 'a'] == -1 && reflect2[pattern[i] - 'a'] == -1) {
reflect1[word[i] - 'a'] = pattern[i] - 'a';
reflect2[pattern[i] - 'a'] = word[i] - 'a';
} else {
if(reflect1[word[i] - 'a'] == pattern[i] - 'a' && reflect2[pattern[i] - 'a'] == word[i] - 'a') {
continue;
} else {
flag = false;
break;
}
}
}
if(flag) {
res.emplace_back(word);
}
}
return res;
}
};