/**
** 问题:
** 在一个由自然数1-1000中某些数字所组成的数组中,每个数字可能出现零次或多次,
** 设计一个算法,找出出现次数最多的数字。
**/
#include <iostream>
const int MAX_SIZE = 1000;
void searchMostTimes(int array[], int size) {
int tmpArray[MAX_SIZE] = {0};
for (int i = 0; i < size; i++) {
tmpArray[array[i] - 1] = tmpArray[array[i] - 1] + 1;
}
int mostTimes = 0;
int mostTimesIndex = 0;
for (int i = 0; i < MAX_SIZE; i++) {
if (tmpArray[i] > mostTimes) {
mostTimes = tmpArray[i];
mostTimesIndex = i + 1;
}
}
std::cout << mostTimesIndex << " appear " << mostTimes<< " times" << std::endl;
}
int main() {
int array[] = {28,21,14,23,28,99,1,5,28,8,28,28,28,28,4,24,28,200,28,4,3,2};
searchMostTimes(array, sizeof(array) / sizeof(*array));
return 0;
}
07-27
457