LeetCode-Find and Replace Pattern

Description：
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

题意：给定一个字符串$words$和一个匹配规则$pattern$，返回字符串中所有符合$pattern$的字符串；

解法：这道题其实和Isomorphic Strings是相似的，前者是判断两个字符串是否为同构的，后者是在字符串数组中找出所有的同构字符串而已；将$pattern$和字符串数组中的所有字符串都转化为数字的形式后比较是否相同即可，转化形式为（例如对于字符串mee）：
$$\begin{gathered} m\to 1 \\ e\to 2 \\ e\to 2 \\ mee\to 122 \end{gathered}$$

Java

class Solution {
    public List<String> findAndReplacePattern(String[] words, String pattern) {
        List<String> res = new ArrayList<>();
        String patternShape = shape(pattern);
        for (String word: words) {
            if (patternShape.equals(shape(word))) {
                res.add(word);
            }
        }
        return res;
    }
    
    private String shape(String s) {
        Map<Character, Integer> map = new HashMap<>();
        StringBuilder res = new StringBuilder();
        int ind = 0;
        for (char ch: s.toCharArray()) {
            if (!map.containsKey(ch)) {
                map.put(ch, ind);
                ind++;
            }
            res.append(map.get(ch));
        }
        return res.toString();
    }
}