leetcode242. Valid Anagram

class Solution { public: bool isAnagram(string s, string t) { int a[26]={0}; if(s.length() != t.length()) return false; for(int i = 0;i < s.length(); i++){ a[s[i]-'a']++; a[t[i]-'a']--; } for(int i = 0;i < 26; i++) if(a[i] != 0) return false; return true; } };