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?

此题比较简单，甚至可以不用使用hashtable来做，只要创建一个数组，然后记录字符串里面字符出现的个数，代码如下：

public class Solution {
    public boolean isAnagram(String s, String t) {
        int[] word = new int[26];
        for(char c:s.toCharArray()){
            word[c-'a']++;
        }
        for(char c:t.toCharArray()){
            word[c-'a']--;
        }
        for(int i:word){
            if(i!=0) return false;
        }
        return true;
    }
}