242 - Valid Anagram

#easy

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Example 1:

Input: s = "anagram", t = "nagaram"
Output: true

Example 2:

Input: s = "rat", t = "car"
Output: false

class Solution {
public:
    bool isAnagram(string s, string t) {
        if ( s.size() != t.size() ) return false;
        int ascii[128] = {0};
        for ( int i = 0; i < s.size(); i++ ) {
            int asc_to_num = s[i];
            ascii[asc_to_num]++;
        }

        for ( int i = 0; i < t.size(); i++ ) {
            int asc_to_num = t[i];
            ascii[asc_to_num]--;
            if ( ascii[asc_to_num] < 0 ) return false;
        }

        return true;
    }
};