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?
C++
//Hash Table O(n)
class Solution {
public:
bool isAnagram(string s, string t) {
int m[256] = {0};
for(auto x : s){
m[x]++;
}
for(auto x : t){
m[x]--;
}
for(auto x : m){
if(x != 0) return false;
}
return true;
}
};
Java
//Hash Table O(n)
class Solution {
public boolean isAnagram(String s, String t) {
int[] m = new int[256];
for(int i = 0; i < s.length(); i++){
m[s.charAt(i) - 'a']++;
}
for(int i = 0; i < t.length(); i++){
m[t.charAt(i) - 'a']--;
}
for(int x : m){
if(x != 0) return false;
}
return true;
}
}
Python
#Sorting O(n*logn)
class Solution(object):
def isAnagram(self, s, t):
return sorted(s) == sorted(t)