【leetcode】【medium】451. Sort Characters By Frequency

451. Sort Characters By Frequency

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

Example 1:

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.

Example 2:

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.

Example 3:

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.

题目链接：https://leetcode.com/problems/sort-characters-by-frequency/

解法

首先用map记录字符出现次数，再对map的value进行排序，最后记录结果。

class Solution {
public:
    string frequencySort(string s) {
        map<char,int> record;
        for(int i=0;i<s.length();++i){
            record[s[i]]++;
        }
        vector<pair<char,int>> smap;
        for(auto it=record.begin();it!=record.end();++it){
            smap.push_back(make_pair(it->first,it->second));
        }
        sort(smap.begin(),smap.end(),
            [](const pair<char, int> &x, const pair<char, int> &y) -> int {
        return x.second > y.second;});
        string res="";
        for(auto it=smap.begin();it!=smap.end();++it){
            while(it->second>0) {
                res+=it->first;
                --(it->second);
            }
        }
        return res;
    }
    
};

对map的value进行排序的2种方法：

1.把value设为key后排序。

2.将map的pair存到vector中用sort排序（需要定义排序的方法）。

！代码中对sort里compare函数的定义用到了lamda表达式，详细参考c++primer这本书的第十章。