leetcode question 242

bool isAnagram(string s, string t)
{
    if (s.size() != t.size()) return false;
    map<char, int> mapS, mapT;
    for (auto i : s)
    {
        mapS[i] += 1;
    }
    for (auto i : t)
    {
        mapT[i] += 1;
    }
    if (mapS.size() != mapT.size()) return false;
    vector<pair<char, int>> tmpS(mapS.begin(), mapS.end());
    vector<pair<char, int>> tmpT(mapT.begin(), mapT.end());
    sort(tmpS.begin(), tmpS.end());
    sort(tmpT.begin(), tmpT.end());
    auto iterS = mapS.begin();
    auto iterT = mapT.begin();
    while (iterS != mapS.end() && iterT != mapT.end())
    {
        if (iterS->first != iterT->first) return false;
        if (iterS->second != iterT->second) return false;
        ++iterS;
        ++iterT;
    }
    return true;
}

bool isAnagram(string s, string t)
{
    sort(s.begin(), s.end());
    sort(t.begin(), t.end());
    return s == t;
}