<p>Given two strings <code>s</code> and <code>t</code>, return <code>true</code> if <code>t</code> is an <span data-keyword="anagram">anagram</span> of <code>s</code>, and <code>false</code> otherwise.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;anagram&quot;, t = &quot;nagaram&quot;</span></p>

<p><strong>Output:</strong> <span class="example-io">true</span></p>
</div>

<p><strong class="example">Example 2:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;rat&quot;, t = &quot;car&quot;</span></p>

<p><strong>Output:</strong> <span class="example-io">false</span></p>
</div>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length, t.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>s</code> and <code>t</code> consist of lowercase English letters.</li>
</ul>

<p>&nbsp;</p>
<p><strong>Follow up:</strong> What if the inputs contain Unicode characters? How would you adapt your solution to such a case?</p>

class Solution {
public:
    bool isAnagram(string s, string t) {
        std::map<char, int> m;
        for(int i=0;i<s.size(); i++) {
            if (m.count(s[i]) > 0) {
                m[s[i]]++;
            } else {
                m[s[i]] = 1;
            }
        }
        for(int i=0;i<t.size();i++) {
            if(m.count(t[i]) > 0) {
                if(--m[t[i]] < 0) return false;
            } else return false;
        }
        map<char, int>::iterator iter;
        for(iter = m.begin(); iter != m.end(); iter++) {
            if (iter->second != 0)
                return false;
        }
        return true;
    }
};
9900