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?
Related Topics:
Hash Table, Sort
Similar Questions:
// OJ: https://leetcode.com/problems/valid-anagram/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(C)
class Solution {
public:
bool isAnagram(string s, string t) {
int cnt[26] = {};
for (char c : s) cnt[c - 'a']++;
for (char c : t) cnt[c - 'a']--;
for (int n : cnt) {
if (n) return false;
}
return true;
}
};