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?

运用字符集数组。

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