直方图

复制代码

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int main(){
    string a;
    while (cin >> a){
        int i, j, max = 0, num[10] = { 0 };
        for (i = 0; i<a.length(); i++) 
            num[a[i] - '0']++;
        for (i = 0; i<10; i++)
        if (num[i]>max)
            max = num[i]; //找到最大次数，即柱状图层数
        for (i = max; i>0; i--){ 
            for (j = 0; j<10; j++){ 
                if (i>num[j])
                    cout << ' '; else cout << '*';
            }
            cout << endl;
        }
        cout << "0123456789" << endl; //标出横轴
    }
    return 0;
}