leetcode 242. Valid Anagram

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

For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return 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 {map<char, int>get_cnt(string s){map<char, int>cnt;for (int i = 0; i < s.length(); i++)cnt[s[i]]++;return cnt;}public:bool isAnagram(string s, string t) {return s.length() == t.length() ? get_cnt(s) == get_cnt(t) : false;}};

accept