[leetcod] Valid Anagram 判断颠倒字母顺序而构成的单词

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.

Note:

You may assume the string contains only lowercase alphabets.

题目大意：判断两个字符串是否仅仅是字母的顺序有颠倒（只含小写单词）

bool isAnagram(char* s, char* t) {

int s_char_count[26] = {0};
int t_char_count[26] = {0};
int i = 0;

for(i = 0; s[i] != '\0'; i++)
{
s_char_count[s[i]-'a']++;
}
for(i = 0; t[i] != '\0'; i++)
{
t_char_count[t[i]-'a']++;
}
for(i = 0; i < 26; i++)
{
if(s_char_count[i] != t_char_count[i])
return false;
}

return true;

}运行时间0ms