408数据结构算法-2013

#include <iostream>

using namespace std;

int findMain(int *array, int n) {
    int map[n];
    int maxN = -1, maxT = -1;
    for (int i = 0; i < n; i++) {
        map[i] = 0;
    }
    for (int i = 0; i < n; i++) {
        map[array[i]]++;
    }
    for (int i = 0; i < n; i++) {
        if (map[i] > maxT) {
            maxT = map[i];
            maxN = i;
        }
    }
    return maxT > n / 2 ? maxN : -1;
}

int main() {
    int array[] = {0, 5, 5, 3, 5, 7, 5, 5};
    cout << findMain(array, 8);
}