Leetcode #242 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 sLen = strlen(s);
	int tLen = strlen(t);
	int alphabet[26] = {0};
	int i, index;
	if(sLen != tLen) return false;
	for(i = 0; i < sLen; ++ i)
	{
		index = s[i] - 'a';
		++ alphbet[index];
	}
	for(i = 0; i < tLen; ++ i)
	{
		index = t[i] - 'a';
		if(alphbet[index] > 0)
			-- alphbet[index];
		else return false;
	}
	return true;
}

只考慮26的字母，直接暴力開一個26的數組。