Leetcode - Find and Replace Pattern

https://leetcode.com/problems/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.

func findAndReplacePattern(words []string, pattern string) []string {
    result := []string{}
    for _, word := range words {
        if match(word, pattern) {
            result = append(result, word)
        }
    }
    return result
}

func match(word string, pattern string) bool {
    hash1 := map[byte]byte{}
    hash2 := map[byte]byte{}
    for i := 0; i < len(pattern); i++ {
        w := word[i]
        p := pattern[i]
        if _, ok := hash1[w]; !ok {
            hash1[w] = p
        }
        if _, ok := hash2[p]; !ok {
            hash2[p] = w
        }
        if hash1[w] != p || hash2[p] != w {
            return false
        }
    }
    return true
}

• 相关文章
• 全局相关文章