242. Valid Anagram Java Solutin

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?

 

Subscribe to see which companies asked this question

由题 只有小写字母，使用26位的数组存储每个字母个数进行比较。

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