class Solution {
public:
bool isAnagram(string s, string t) {
int num[26] = {0};//清0
for (int i = 0; i < s.length(); i++){
num[s[i]-'a']++;
}
for (int j = 0; j < t.length(); j++){
num[t[j]-'a']--;
}
for (int k = 0; k < 26; k++){
if (num[k] != 0){
return false;
}
}
return true;
}
};