Given two strings s and t, write a function to determine if t is an anagram of s.
For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return false.
Note:
You may assume the string contains only lowercase alphabets.
class Solution(object):
def isAnagram(self, s, t):
"""
:type s: str
:type t: str
:rtype: bool
"""
d = {}
d1={}
for i in s:
if i in d:
d[i]+=1
else:
d[i]=1
for i in t:
if i in d1:
d1[i]+=1
else:
d1[i]=1
return d==d1