[LeetCode] 242. Valid Anagram

题：https://leetcode.com/problems/valid-anagram/description/

题目

Given two strings s and t , write a function to determine if t is an anagram of s.

Example 1:

Input: s = "anagram", t = "nagaram"
Output: true

Example 2:

Input: s = "rat", t = "car"
Output: 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?

题目大意

两个字符串包含的字符 种类和数量 是否完全相同

思路

HashMap 映射字符与出现次数，然后比较两个字符串出现的字符数量是否相同。

由字符串只包含 26个小写字符，所以 用 26 位 数组 代替 HashMap。

class Solution {
    public boolean isAnagram(String s, String t) {
        int[] cnts =new int[26];
        for(char c : s.toCharArray())
            cnts[c-'a']++;
        for(char c : t.toCharArray())
            cnts[c-'a']--;
        for(int cnt : cnts)
            if(cnt!=0)
                return false;
        return true;
    }
}