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;
int bit[26] = {0}, len = s.length();

for(int i=0; i bit[s[i]-'a']++;

for(int i=0; i if(--bit[t[i]-'a'] < 0)
return false;
return true;
}
};

?