【CODE】Sort Characters By Frequency

451. Sort Characters By Frequency

Medium

91684FavoriteShare

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.

class Solution {
public:
    string frequencySort(string s) {
        int n=s.size();
        string res="";
        map<char,int> mp;
        for(int i=0;i<n;i++){
            mp[s[i]]++;
        }
        priority_queue<pair<int,char> > q;
        map<char,int>::iterator it;
        for(it=mp.begin();it!=mp.end();it++){
            q.push(make_pair(it->second,it->first));
        }
        while(q.size()!=0){
            int num=q.top().first;
            for(int i=0;i<num;i++) res+=q.top().second;
            q.pop();
        }
        return res;
    }
};

• Runtime: 16 ms, faster than 75.97% of C++ online submissions for Sort Characters By Frequency.
• Memory Usage: 10.7 MB, less than 76.47% of C++ online submissions for Sort Characters By Frequency.
• Next challenges:
• Longest Substring with At Most Two Distinct Characters
• Kth Largest Element in a Stream
• Design HashMap