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.

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