题目:
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 {
public:
bool isAnagram(string s, string t) {
unordered_map<char, int> hash;
for (auto val : s) {
++hash[val];
}
for (auto val : t) {
--hash[val];
}
for (auto val : hash) {
if (val.second != 0) {
return false;
}
}
return true;
}
};