LeetCode OJ 451. Sort Characters By Frequency

LeetCode OJ 451. Sort Characters By Frequency

---

Description

Given a string, sort it in decreasing order based on the frequency of characters.

Example1

Input:
“tree”

Output:
“eert”

Explanation:
‘e’ appears twice while ‘r’ and ‘t’ both appear once.
So ‘e’ must appear before both ‘r’ and ‘t’. Therefore “eetr” is also a valid answer.

Example2

Input:
“cccaaa”

Output:
“cccaaa”

Explanation:
Both ‘c’ and ‘a’ appear three times, so “aaaccc” is also a valid answer.
Note that “cacaca” is incorrect, as the same characters must be together.

Example3

Input:
“Aabb”

Output:
“bbAa”

Explanation:
“bbaA” is also a valid answer, but “Aabb” is incorrect.
Note that ‘A’ and ‘a’ are treated as two different characters.

解题思路

之前做过类似的题目，统计k个字母或数字出现的次数使用的其中一个方法是使用heap(priority_queue)，priority_queue使用把默认是最大堆，根据优先级高低排序，top()返回的是优先级最高的元素。在这道题返回的是出现次数最多的字符，而且字符出现的次数也保存在该元素中。

Note:

为了简化代码，在读取字符出现次数时使用unordered_map<char, int>，这样可以直接做自加的操作来统计字符出现次数，而保存到优先队列的时候使用priority_queue<pair<int, char>> pq，这样可以直接根据出现次数来对字符进行排序。

代码

个人github代码链接

class Solution {
public:
    string frequencySort(string s) {
        unordered_map<char, int> m;
        for(int i = 0; i < s.length(); i++)
            m[s[i]]++;
        string ans = "";
        priority_queue<pair<int, char>> pq;
        for(auto itr = m.begin(); itr != m.end(); itr++)
            pq.push(pair<int, char>(itr->second, itr->first));
        while(!pq.empty()){
            for(int i = 0; i < pq.top().first; i ++)
                ans += pq.top().second;
            pq.pop();
        }
        return ans;
    }
};