習題7-2 求一批整數中出現最多的個位數字

#include<stdio.h>

int main(void)
{
    int n;
    int number[1000];
    int digit[10] = {0};        //記錄每個數字出現的次數
    int temp;

    scanf_s("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf_s("%d", &number[i]);
    }

    for (int i = 0; i < n; i++)
    {
        do
        {
            temp = number[i] % 10;
            digit[temp]++;
            number[i] = number[i] / 10;
        } while (number[i] > 0);
    }

    int max_index = 0;
    for (int i = 1; i < 10; i++)
    {
        if (digit[i] > digit[max_index])
        {
            max_index = i;
        }
    }

    printf("%d:", digit[max_index]);
    for (int i = 0; i < 10; i++)
    {
        if (digit[i] == digit[max_index])
        {
            printf(" %d", i);
        }
    }

    printf("\n");

    return 0;
}