算法分析与设计——LeetCode Problem.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.

---

问题分析及思路

题目大意是将一个字符串变为一个按字母个数多少排序，同一个字母出现次数多排在前面的字符串。
由于个数不多，直接暴力破解，使用一个256位的数组进行遍历即可，最后的算法时间打败了百分之八十五的人！

---

具体代码

class Solution {
public:
    string frequencySort(string s) {
        int a[256];
        int howmany = 0;
        for(int i = 0; i < 256; i ++) a[i] = 0;
        for(int i = 0; s[i] != '\0'; i++) {
            if(a[s[i]] == 0) howmany++;
            a[s[i]]++;
        }
        string newS;
        while(howmany != 0) {
            int max = 0;
            int maxi = 0;
            int i;
            for(i = 0; i < 256; i++) {
                if(a[i] > max) {
                    max = a[i];
                    maxi = i;
                }
            }
            char c = maxi;

            for(int j = 0; j < max; j++) {
                newS += c;
            }
            a[maxi] = 0;
            howmany--;
        }
        return newS;
    }
};