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.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
class Solution(object):
def isAnagram(self, s, t):
"""
:type s: str
:type t: str
:rtype: bool
"""
d = [0 for _ in xrange(256)]
if len(s) != len(t): return False
for c in s:
d[ord(c)] += 1
for c in t:
if d[ord(c)] < 1: return False
d[ord(c)] -= 1
return True