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
Solution:
class Solution {
public List<String> findAndReplacePattern(String[] words, String pattern) {
List<String> result = new ArrayList();
for (String s : words) {
if (match(s, pattern)) {
result.add(s);
}
}
return result;
}
private boolean match(String s, String p) {
Map<Character, Character> map = new HashMap();
Map<Character, Character> map2 = new HashMap();
for (int i = 0; i < s.length(); i ++) {
char a = s.charAt(i), b = p.charAt(i);
if (map.containsKey(a) && map.get(a) != b || map2.containsKey(b) && map2.get(b) != a) {
return false;
}
map.put(a, b);
map2.put(b, a);
}
return true;
}
}