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
Constraints:
1 <= s.length, t.length <= 5 * 104s and t consist of lowercase English letters.
Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?
class Solution {
public:
bool isAnagram(string s, string t) {
if (s.length()!=t.length())
return false;
map <char, int> m;
for(int i=0; i<s.length(); i++)
m[s[i]]++;
for(int i=0; i<t.length(); i++)
m[t[i]]--;
for(auto e:m)
if(e.second!=0)
return false;
return true;
}
};/**
* @param {string} s
* @param {string} t
* @return {boolean}
*/
var isAnagram = function(s, t) {
return s.split('').sort().join('')===t.split('').sort().join('');
};