Leetcode 890 finding and replacing patterns [map] the leetcode path of heroding

Their thinking ：
In essence, it is to solve a bi-directional mapping problem , For each word and pattern Every letter in , Must be bi-directional mapping , Like weight mee and abb, must e and b Corresponding , And b and e Corresponding , This requires the construction of two arrays to store word The corresponding letter subscript and pattern The mapping of the corresponding letter subscript in , as well as pattern The corresponding letter subscript and word The mapping of the corresponding letter subscript in , If they can all correspond to , be word Satisfy the matching pattern , Put in res Array , Otherwise directly break, The code is as follows ：

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;
    }
};