leetcode 451. Sort Characters By Frequency

1.题目

Given a string, sort it in decreasing order based on the frequency of characters.
给定一个字符串，按字符出现频率从大到小排序
Example 1:

Input:
“tree”
Output:
“eert”

Example 2:

Input:
“cccaaa”
Output:
“cccaaa”

Example 3:

Input:
“Aabb”
Output:
“bbAa”或”bbaA”

次数多的字符排前面，次数一样的字符位置随意不计较前后

2.分析

1）用unordered_map对字符出现计数
2）按出现次数排序
3）把字符一次加到输出结果中

3.代码

class Solution {
public:
    static bool Cmp(pair<char, int>a, pair<char, int>b) {
        return a.second > b.second;
    }
    string frequencySort(string s) {
        if (s.size() < 3)
            return s;
        unordered_map<char, int> Maps;
        for (char c : s)//统计字符出现次数
            Maps[c] += 1;
        vector<pair<char, int>> hashMap(Maps.begin(), Maps.end());  
        sort(hashMap.begin(), hashMap.end(), Cmp);//排序
        string ans;
        for(auto p:hashMap)
            ans.insert(ans.end(), p.second, p.first);
        return ans;
    }
};