好久没更新了,因为懒otz
Description
Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows:
int isAnagram(const char * const s1, const char * const s2)
int isAnagram(const char * const s1, const char * const s2){
int re=0;
int size=strlen(s1);
int num=strlen(s2);
if(num!=size)return 0;
char count[size];
for(int i=0;i<size;i++)count[i]=*(s2+i);
for(int i=0;i<size;i++){
for(int k=0;k<size;k++){
if(*(s1+k)==count[i]){
re++;
count[i]=0;//意思是比较过的就不要再比了
}
}
}
if(re==size)return 1;
else return 0;
}