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.
1,排序后比较
2,计数
计一个,第二个减,非0则错
class Solution {
public:
bool isAnagram(string s, string t) {
int sNum[26];
int tNum[26];
int i;
for(i=0;i<26;i++) sNum[i]=0;
for(i=0;i<26;i++) tNum[i]=0;
int sSize=s.size();
int tSize=t.size();
bool flag=true;
if(sSize!=tSize) return false;
int x;
for(i=0;i<sSize;i++)
{
x=s[i]-'a';
sNum[x]=sNum[x]+1;
}
for(i=0;i<tSize;i++)
{
x=t[i]-'a';
tNum[x]=tNum[x]+1;
}
for(i=0;i<26;i++)
{
if(sNum[i]!=tNum[i]) flag=false;
}
return flag;
}
};