fork download
  1. class Solution:
  2. def isAnagram(self, s: str, t: str) -> bool:
  3. map1 = {}
  4. map2 = {}
  5. for char in s:
  6. if char not in map1:
  7. map1[char] = 1
  8. else :
  9. map1[char] += 1
  10.  
  11. for char in t:
  12. if char not in map2:
  13. map2[char] = 1
  14. else :
  15. map2[char] += 1
  16.  
  17. return map1 == map2
  18.  
Success #stdin #stdout 0.09s 14068KB
stdin
Standard input is empty
stdout
Standard output is empty