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?

题目大意：判断t是不是s的一个随机重排字符组成的字符串。

思路一：将s和t排序，排好序后，每个位置判断是否相同

思路二：只有小写字母，可以用大小为26的数组统计个数。（如果不止小写字母，可以用map）

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