leetcode：890. Find and replace mode [two dict records set]

analysis

With two dict Record separately word To pattern and pattern To word Mapping
then dict The content is a set, We must make sure that after each update set The length of will not be greater than or equal to 2 Can meet the double shot

ac code

class Solution:
    def findAndReplacePattern(self, words: List[str], pattern: str) -> List[str]:
        ans = []
        m = len(pattern)
        for word in words:
            myDict1 = defaultdict(set)
            myDict2 = defaultdict(set)
            flag = True
            for i in range(m):
                myDict1[pattern[i]].add(word[i])
                myDict2[word[i]].add(pattern[i])
                if len(myDict1[pattern[i]]) >= 2 or len(myDict2[word[i]]) >= 2:
                    flag = False
                    break
            if flag:
                ans.append(word)
        
        return ans

summary

Understanding of bijection
dict + set application