Leetcode 451. Sort Characters By Frequency

Tyan

发布于 2019-05-25 22:50:16

3540

发布于 2019-05-25 22:50:16

文章被收录于专栏：SnailTyan

文章作者：Tyan

博客：noahsnail.com | CSDN | 简书

1. Description

2. Solution

bool compare(pair<char, int>& a, pair<char, int>& b) {
    return a.second > b.second;
}

class Solution {
public:
    string frequencySort(string s) {
        map<char, int> stat;
        for(int i = 0; i < s.length(); i++) {
            stat[s[i]]++;
        }
        vector<pair<char, int>> values;
        for(auto val: stat) {
            values.push_back(val);
        }
        sort(values.begin(), values.end(), compare);
        string result;
        for(auto val : values) {
            for(int i = 0; i < val.second; i++) {
                result += val.first;
            }
        }
        return result;
    }
};