LeetCode 890. Find and Replace Pattern C++ [自己开发的博客网站，欢迎访问](www.weiboke.online) www.weiboke.online

自己开发的博客网站，欢迎访问 www.weiboke.online
#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

##Approach

1. 题目大意就是words数组种找出与pattern模式相匹配的字符串，比如pattern是ABB类的，那么就查找words中ABB类的字符串，这道题不难，题目已经给了很多暗示，题目直接说就是一个字母映射到另一个字母，所以直接按题意做即可，所以我这里也是按题目意思做的，我采用双映射方式，将pattern的一个字母映射word中的一个字母，然后word这个字母也映射pattern的这个字母，这样下次可以直接判断这两个字母映射的是否相同。

Code

class Solution {
public:
	vector<string> findAndReplacePattern(vector<string>& words, string pattern) {
		vector<string>res;
		int n = pattern.size();
		for (string &word : words) {
			if (word.size() != n)continue;
			vector<char>pletter(256, '#');
			vector<char>wletter(256, '#');
			bool flag = false;
			for (int i = 0; i < n; i++) {
				if (pletter[pattern[i]] == '#'&&wletter[word[i]]=='#') {
					pletter[pattern[i]] = word[i];
					wletter[word[i]] = pattern[i];
				}
				else if (pletter[pattern[i]] == word[i]&& wletter[word[i]]==pattern[i]) {
					continue;
				}
				else {
					flag = true;
					break;
				}	
			}
			if (!flag)res.push_back(word);
		}
		return res;
	}
};