242. Valid Anagram

題目原文

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?

解題思路

1. 一定有更好的答案，我暫時還想不到:(。

程式解答

class Solution 
{
public:
    bool isAnagram(string s, string t) 
    {
        map<int, int> p;

        for (int i = 0; i < s.size(); i++)
            p[s[i]]++;
        for (int j = 0; j < t.size(); j++)
            p[t[j]]--;
        for (int k = 'a'; k < 'z'; k++)
            if (p[k] != 0)
                return false;
        return true;
    }
};