242. Valid Anagram

Problem:

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?

Analysis:

本题的思路是维持一个长26的整型数组用来记录数组中字符出现次数，然后依次进行匹配，如果发现两个字符串的字符数字不匹配则立即返回false。代码如下：

Code:

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