选择在普通C中的数组上具有更多重复项的元素

#include <stdio.h>

int findMostFrequentElement(int arr[], int size) {
    // 创建哈希表
    int hash[1000] = {0};
    
    // 遍历数组并记录每个元素的出现次数
    for (int i = 0; i < size; i++) {
        hash[arr[i]]++;
    }
    
    // 找到出现次数最多的元素
    int maxCount = 0;
    int mostFrequentElement = 0;
    for (int i = 0; i < 1000; i++) {
        if (hash[i] > maxCount) {
            maxCount = hash[i];
            mostFrequentElement = i;
        }
    }
    
    return mostFrequentElement;
}

int main() {
    int arr[] = {1, 2, 3, 4, 2, 3, 3, 4, 4, 4};
    int size = sizeof(arr) / sizeof(arr[0]);
    
    int mostFrequentElement = findMostFrequentElement(arr, size);
    
    printf("The most frequent element is: %d\n", mostFrequentElement);
    
    return 0;
}