242. 有效的字母异位词
方法
class Solution {
public:
bool isAnagram(string s, string t) {
int slength = s.length(), tlength = t.length();
if(slength != tlength){
return false;
}
vector<int> sNum(26,0);
vector<int> tNum(26,0);
for(int i = 0;i < slength; i++){
sNum[s[i]-'a']++;
tNum[t[i]-'a']++;
}
for(int i = 0; i < 26; i++){
if(sNum[i] != tNum[i]){
return false;
}
}
return true;
}
};
class Solution {
public:
bool isAnagram(string s, string t) {
if (s.length() != t.length()) {
return false;
}
vector<int> table(26, 0);
for (auto& ch: s) {
table[ch - 'a']++;
}
for (auto& ch: t) {
table[ch - 'a']--;
if (table[ch - 'a'] < 0) {
return false;
}
}
return true;
}
};
class Solution {
public:
bool isAnagram(string s, string t) {
if (s.length() != t.length()) {
return false;
}
sort(s.begin(), s.end());
sort(t.begin(), t.end());
return s == t;
}
};