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?
这个题目很简单,只要两个字符串中相同的字符的个数相同,就返回true,否则返回false
class Solution { public: bool isAnagram(string s, string t) { map<char,int> ms,mt; for(auto e:s) { ms[e]+=1; } for(auto e:t) { mt[e]+=1; } return ms==mt; } };