输入 3
1234 2345 3456
输出 3: 3 4
//求一批整数中出现最多的个位数字
int main()
{
int n = 0, number = 0;
int arr[10] = { 0 };
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &number);
if (number == 0)
{
arr[0]++;
}
while (number > 0)
{
arr[number % 10]++;
number /= 10;
}
}
int max = arr[0];
for (int j = 0; j < 10; j++)
{
if (max < arr[j])
{
max = arr[j];
}
}
printf("%d:", max);
for (int k = 0; k < 10; k++)
{
if (max == arr[k])
{
printf(" %d", k);
}
}
return 0;
}