leetcode -- 890. Find and Replace Pattern

You have a list of words and a pattern, and you want to know which words in words matches the pattern.

A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get the desired word.

(Recall that a permutation of letters is a bijection from letters to letters: every letter maps to another letter, and no two letters map to the same letter.)

Return a list of the words in words that match the given pattern. 

You may return the answer in any order.

 

Example 1:

Input: words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb"
Output: ["mee","aqq"]
Explanation: "mee" matches the pattern because there is a permutation {a -> m, b -> e, ...}. 
"ccc" does not match the pattern because {a -> c, b -> c, ...} is not a permutation,
since a and b map to the same letter.
 

Note:

1 <= words.length <= 50
1 <= pattern.length = words[i].length <= 20

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-and-replace-pattern
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

我的思路：

1. res保存结果

2. p数组记录在pattern中字母是否已经有对应的数字，w数组记录在words数组里是否有对应的数字

3. c2iP记录pattern中字符对应的数字，c2iW记录在words中对应的数字

4. 将pattern转成对应数字字符串，将words也转成对应字符字符串，然后进行比较，若相等则放入res，若不等则不行

 

class Solution {
public:
    vector<string> findAndReplacePattern(vector<string>& words, string pattern) {
        vector<string> res;
        bool p[27] = {false};
        bool w[27] = {false};
        map<char, int> c2iP;
        map<char, int> c2iW;
        string pp = "";
        for(int i = 0; i < pattern.size(); i++){
            if(p[pattern[i]-'a'] == false){
                p[pattern[i]-'a'] = true;
                c2iP[pattern[i]] = i;
                pp += i+'0';
            }else{
                pp += c2iP[pattern[i]]+'0';
            }
        }
        
        for(int i = 0; i < words.size(); i++){
            c2iW.clear();
            string ww ="";
            fill(w,w+27,false);
            for(int j = 0; j < words[i].size(); j++){
                if(w[words[i][j]-'a'] == false){
                    w[words[i][j]-'a'] = true;
                    c2iW[words[i][j]] = j;
                    ww += j+'0';
                }else{
                    ww += c2iW[words[i][j]]+'0';
                }
            }
            if(pp == ww) res.push_back(words[i]);
        }
        return res;
    }
};