Package g0801_0900.s0890_find_and_replace_pattern

Class Solution

java.lang.Object

g0801_0900.s0890_find_and_replace_pattern.Solution

public class Solution
extends Object

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"] **Constraints:** * `1 <= pattern.length <= 20` * `1 <= words.length <= 50` * `words[i].length == pattern.length` * `pattern` and `words[i]` are lowercase English letters.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<String>	findAndReplacePattern(String[] words, String pattern)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findAndReplacePattern

public List<String> findAndReplacePattern(String[] words,
 String pattern)