LeetCode242: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 count[26]={0};
    if(strlen(s)==0&&strlen(t)==0)
    {
        return true;
    }
    for(int i=0;i<strlen(t);i++)
    {
        count[t[i]-'a']++;
    }
    for(int i=0;i<strlen(s);i++)
    {
        count[s[i]-'a']--;
    }
    for(int i=0;i<26;i++)
    {
        if(count[i]!=0)
        {
            return false;
        }
    }
    return true;
}