题解 | #字符统计#

又是1暴力，为了解题而解题

#include <algorithm>
#include <memory.h>
using namespace std;
bool cmp(int a, int b)
{
    return a > b;
}
int main()
{
    string str, result;
    int alpCount[128], tmpData[128];
    while(cin >> str) {
        result.clear();
        memset(alpCount, 0, sizeof(alpCount));
        for(int i = 0; i < str.length(); i++) {
            alpCount[int(str[i])] += 1;
        }
        memcpy(tmpData, alpCount, sizeof(alpCount));
        //次数从大道小排
        sort(tmpData, tmpData + 128, cmp);
        for (int i = 0; i < 128; i++) {
            int value = tmpData[i];
            if (value == 0)
                break;
            for (int j = 0; j < 128; j++) {
                if ((alpCount[j] == value) && 
                    (result.find(char(j)) == -1 || 
                    result.find(char(j)) == string::npos))
                    result = result + char(j);
            }
        }
        cout << result << endl;
    }
}