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

# @lc code=start
using LeetCode

function find_and_replace_pattern(words::Vector{String}, pattern::String)
    function arr_pattern(s::String)
        arr_pt = Char[]
        dct = Dict{Char, Char}()
        cur_ch = 'a'
        for ch in s
            if !haskey(dct, ch)
                dct[ch] = cur_ch
                cur_ch += 1
            end
            push!(arr_pt, dct[ch])
        end
        arr_pt
    end
    res = String[]
    a_pt = arr_pattern(pattern)
    for w in words
        if a_pt == arr_pattern(w)
            push!(res, w)
        end
    end
    res
end
# @lc code=end

find_and_replace_pattern (generic function with 1 method)

This page was generated using DemoCards.jl and Literate.jl.