242. Valid Anagram

题目

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?

我的解法

public class Solution {
    public boolean isAnagram(String s, String t) {
        if(s.length() != t.length())
            return false;
        int[] arr = new int[26];
        // 若两字符串为回文，则最终数组元素全为0
        for(char c : s.toCharArray())
            arr[c - 'a'] += 1;
        for(char c : t.toCharArray())
            arr[c - 'a'] -= 1;
        for(int n : arr)
            if(n != 0)
                return false;
        return true;
    }
}