1021 个位数统计

100311

0:2
1:3
3:1

    题目很简单，直接上代码

#include<iostream>
#include<string>
#include<map>
using namespace std;
int main()
{
    map<int,int> mp;
    string N;
    cin>>N;
    for(int i=0;i<10;i++)
        mp[i]=0;
    for(unsigned int i=0;i<N.length();i++)
    {
        switch(N[i]-‘0‘)
        {
            case 0: mp[0]++;break;
            case 1: mp[1]++;break;
            case 2: mp[2]++;break;
            case 3: mp[3]++;break;
            case 4: mp[4]++;break;
            case 5: mp[5]++;break;
            case 6: mp[6]++;break;
            case 7: mp[7]++;break;
            case 8: mp[8]++;break;
            case 9: mp[9]++;break;
        }
    }
    for(int i=0;i<10;i++)
    {
        if(mp[i]==0)  //出现次数为0的数字跳过
            continue;
        cout<<i<<":"<<mp[i]<<endl;
    }
    return 0;
}

ac了