1.描述

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.

Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?

2.分析

3.代码

class Solution {
public:
    bool isAnagram(string s, string t) {
        if (s.length() != t.length()) return false;
        if (s.length() == 0 && t.length() == 0) return true;
        
        int arrA[30] = {0};
        int arrB[30] = {0};
        for (int i = 0; i < s.length(); ++i) {
            arrA[s[i] - 'a']++;
        }
        for (int i = 0; i < t.length(); ++i) {
            arrB[t[i] - 'a']++;
        }
        for (int i = 0; i < 29; ++i) {
            if (arrA[i] != arrB[i]) return false;
        }
        return true;
    }
};