Submission Details

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.

Solution:

public class Solution {
    public boolean isAnagram(String s, String t) {
        if(s == null && t == null) return true;
        if(s == null || t == null) return false;
        if(s.length() != t.length()) return false;
        int[] smap = new int[27], tmap = new int[27];
        for(int i = 0; i< s.length(); i++){
            smap[s.charAt(i) - 'a']++;
            tmap[t.charAt(i) - 'a']++;
        }
        for(int j = 0; j< 26; j++) if(smap[j] != tmap[j]) return false;
        return true;
    }
}