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 {
public:
bool isAnagram(string s, string t) {
if (s.size() != t.size()) {
return false;
}
vector<int> chars(26, 0);
for (int i = 0; i < s.size(); ++i) {
++chars[s[i]-'a'];
--chars[t[i]-'a'];
}
for (int i = 0; i < 26; ++i) {
if (chars[i] != 0) {
return false;
}
}
return true;
}
};