[LeetCode 解题报告]242. Valid Anagram

Given two strings s and t , write a function to determine if t is an anagram of s.

Example 1:

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

Example 2:

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

Note:
You may assume the string contains only lowercase alphabets.

Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?

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