Files
PS/leetcode/242.py
Gyubin Han dede0dca01 leetcode
2025-02-19 14:09:55 +09:00

22 lines
470 B
Python

class Solution:
def isAnagram(self, s: str, t: str) -> bool:
d={}
if not len(s)==len(t):
return False
for i in s:
if i in d:
d[i]+=1
else:
d[i]=1
for i in t:
if i in d:
d[i]-=1
else:
return False
for i in d.keys():
if not d[i]==0:
return False
return True