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.

题意：给出一个字符串，要求将字符串中的字母按照其出现次数递减的顺序输出。

思路一：使用了前向星的思想存储每个字母与其出现的次数，还使用到了unordered_map与sort。具体实现如下：

//结构体，记录每个字母与其出现的次数。
struct Node {
        int cnt;
        char val;
}node[1100];
//按照出现次数由高到低进行排序 
bool cmp(const Node a,const Node b) {
    return a.cnt>b.cnt;
}

class Solution {
public:
    //使用unordered_map实现字母与结构体数组下标的映射 
    unordered_map<char,int>mp;
    int tot=0;
    string frequencySort(string s) {
        string str;
        for(int i=0;i<s.length();i++) {
                if(mp.count(s[i])!=0){
                    node[mp[s[i]]].cnt++;
                }
                else {
                    mp[s[i]]=tot++;
                    node[mp[s[i]]].cnt=1;
                    node[mp[s[i]]].val=s[i];
                }
        }    
        sort(node,node+tot,cmp);
        for(int i=0;i<tot;i++) {
            for(int j=0;j<node[i].cnt;j++)
                str+=node[i].val;
        }
        return str;
    }
};

思路二：开辟一string类型的动态数组，将字串中的元素按照其出现次数，加入到数组中相应位置的字符串中。最后从后向前遍历并加上动态数组中的元素，即为答案。

class Solution {
public:
    string frequencySort(string s) { 
        unordered_map<char, int> mp;
        //开辟一大小为s.length()+1的动态数组，数组初始元素为"" 
        vector<string> vec(s.length()+1, "");
        for(int i=0;i<s.length();i++)
            mp[s[i]]++;
        // 根据出现个数，将其加入到对应位置的string中。 
        for(auto val: mp) 
            vec[val.second].append(val.second, val.first);
        string ans;
        // 从后向前遍历，即按照出现次数从高到低遍历。 
        for(int i = s.length(); i > 0; i--)
            ans += vec[i];
        return ans;
    }
};