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 class Solution { public boolean isAnagram(String s, String t) { int[] map = new int[26]; char[] cs = s.toCharArray(); for(char c : cs) { int x = c - 'a'; map[x] += 1; } cs = t.toCharArray(); for(char c : cs) { int x = c - 'a'; if(map[x] == 0) { return false; } map[x] -= 1; } for(int x : map) { if(x != 0) { return false; } } return true; } } //是否字母順序不一樣，用一個哈希表記錄其中一個字符串的每一個字符及 //出現的次數。用另一個字符串的字符當作key獲取value判斷是否存在。 ```