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.
首先是要两个字符串的长度想等;
然后统计每个字母出现的次数;
最后是比较每个字母出现的次数是否相等;
bool isAnagram(char* s, char* t) {
int a[26]={0},b[26]={0};
int i;
if(strlen(s)!=strlen(t))
return false;
i=0;
while(s[i]!='\0')
{
a[s[i]-'a']++;
b[t[i]-'a']++;
i++;
}
for(i=0;i<26;i++)
{
if(a[i]!=b[i])
break;
}
if(i==26)
return true;
else
return false;
}