Leetcode242. Valid Anagram

题目：

 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?

Subscribe to see which companies asked this question
解题思路：使用STL unordered_map 
C++代码  

class Solution {
public:
bool isAnagram(string s, string t) {
int tmp=0;
unordered_map<char,int> hashmap;
for(auto a:s)
hashmap[a]++;
for(auto a:t)
hashmap[a]--;
for(auto a:hashmap)
{
if(a.second!=0)
{
tmp=1;
}
}
if(tmp==0)
return true;
else
return false;
}
};