242. 有效的字母异位词

class Solution {
    public boolean isAnagram(String s, String t) {
        if(s.length() != t.length())
            return false;
        char[] char_s = s.toCharArray();
        char[] char_t = t.toCharArray();
        int[] count = new  int[26];
        for (int i = 0; i < char_s.length; i++) {
            count[char_s[i] - 'a']++;
            count[char_t[i] - 'a']--;

        }
        for (int i = 0; i < count.length; i++) {
            if (count[i]!=0)
                return false;
        }
        return true;
    }
}