LeetCode 242. Valid Anagram(java)

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?

思路：用伪哈希表来记录两个string的不同character出现的次数，数第一个的时候加1，数第二个的时候减1，最后的数组如果都为空，则返回true。

public boolean isAnagram(String s, String t) {
        //special case
        if (s.length() == 0 && t.length() == 0) return true;
        if (s.length() == 0 || t.length() == 0) return false;
        if (s.length() != t.length()) return false;
        //general case
        int[] set = new int[26];
        for (int i = 0; i < s.length(); i++) {
            char ss = s.charAt(i);
            char tt = t.charAt(i);
            set[ss - 'a']++;
            set[tt - 'a']--;
        }
        for (int i : set) {
            if (i != 0) return false;
        }
        return true;
    }