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[] set = new int[256];

        int i =0, j =0;
        for(; i<s.length()&&j<t.length(); i++,j++){
            set[s.charAt(i)]++;
            set[t.charAt(j)]--;
        }

        for(int count : set){
            if(count != 0) return false;
        }
        return true;

    }
}