242. valid Letter heteronyms

242. Effective alphabetic words

Original title link ：https://leetcode.cn/problems/valid-anagram/

Given two strings s and t , Write a function to determine t Whether it is s Letter heteronym of .

Be careful ： if s and t Each character in the has the same number of occurrences , said s and t They are mutually alphabetic words .

Example 1:

Input : s = “anagram”, t = “nagaram”
Output : true
Example 2:

Input : s = “rat”, t = “car”
Output : false

Tips :

1 <= s.length, t.length <= 5 * 104
s and t Only lowercase letters

Their thinking ：

Count the number of characters in the string , In the dictionary , Then judge whether the dictionaries are the same .

Code implementation ：

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        import collections
        a = collections.defaultdict(int)
        b = collections.defaultdict(int)

        for c in s:
            a[c] += 1
        
        for c in t:
            b[c] += 1
        
        if a == b:
            return True
        
        return False