Sort character by frequency

注意字符串的操作，这道题就是把所有的字符统计起来，然后每次拼接找最大值

 

static int fast_io = []() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    return 0;
}();


class Solution {
public:
    string frequencySort(string s) {
        map<char, int> freq;
        for(char c: s){
            if(freq.find(c) == freq.end())
                freq[c] = 1;
            else 
                freq[c] += 1;
        }
        using Pair = pair<char, int>;
        auto cmp = [](Pair x, Pair y){ return x.second < y.second;};
        using Heap = priority_queue<Pair, vector<Pair>, decltype(cmp)>;
        Heap heap(cmp);
        for(auto item = freq.begin(); item != freq.end(); item++){
            heap.push(*item);
        }
        string result = "";
        while(!heap.empty()){
            result += string(heap.top().second, heap.top().first);
            heap.pop();
        }
        return result;
    }
};

找一个代码比较简洁的答案：

注意append以及char的定义域只有128个数等等。另外注意pair的初始化等等，都需要积累。

class Solution {
public:
    string frequencySort(string s) {
        vector<int> freq(128, 0);
        for(auto ch: s) freq[ch]++;
        priority_queue<pair<int, char>> pq;
        for(int i = 0; i < 128; i++) {
            if(freq[i] > 0) pq.push({freq[i], i});
        }
        string res("");
        while(!pq.empty()) {
            auto p = pq.top();
            pq.pop();
            res.append(p.first, p.second);
        }
        
        return res;
        
    }
};