Leetcode 890. Find and Replace Pattern || Medium
Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the answer in any order.
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.
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.
Example 2:
Input: words = ["a","b","c"], pattern = "a"
Output: ["a","b","c"]
Link to challenge: https://leetcode.com/problems/find-an...
Sur cette page du site, vous pouvez voir la vidéo en ligne Leetcode 890. Find and Replace Pattern || Medium durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur Code with Alisha 21 mai 2021, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 6,237 fois et il a aimé 179 téléspectateurs. Bon visionnage!
