242. Effective letter heteronyms

Using arrays a by s Every letter in the book +1 Count , Re traversal t, Subtract all the letters that appear 1, Finally, traverse the array a, If there is, it does not mean 0 The situation of , Description is not a heterotopic word .

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

An array is like a simple hash table .