找出一组数据中出现最多的一个数字

#define _CRT_SECURE_NO_WARNINGS
#include
#include<stdlib.h>
using namespace std;
void appear_most( char str[100][100], int n)
{
int arr[‘9’] = {0};
char* p = str[0];
for (int i = 0;i < n;i++)
{
p = str[i];
while (*p != ‘\0’)
{
arr[*p]++;
p++;
}
}
int tmp = ‘0’;
for (int i = ‘0’;i <= ‘9’;i++)
{
if (arr[i] > arr[tmp])
{
tmp = i;
}
}
cout << arr[tmp]<<":";
for (int i = ‘\0’;i <= ‘9’;i++)
{
if (arr[i] == arr[tmp])
{
cout << i - ‘0’ << " ";
}
}
}
int main()
{
int n = 0;
cout << "please input the arr’s number: ";
cin >> n;
char str[100][100];
for (int i = 0;i < n;i++)
{
cin >> str[i];
}
appear_most(str, n);
return 0;
}