【剑指Offer学习】【面试题29 ：数组中出现次数超过一半的数字】

https://blog.csdn.net/qq_43414142/article/details/98068177 

 

bool findMaxNum(int a[],int len, int* ret) {
    if (a == NULL || len == 0) {
        return false;
    }
    int count = 1;
    int result = a[0];
    for (int i =1; i<len;i++) {
        if (count == 0) {
            result = a[i];
        }
        if (a[i] == result) {
            count++;
        }
        else {
            count--;
        }
    }
    int totalCount = 0;
    for (int j =0 ; j < len; j++) {
        if (a[j] == result) {
            totalCount++;
        }
    }
    return totalCount>len/2?true:false;
}

    int maxNum[] = {1, 2, 2, 2, 2, 2, 2, 8, 9, 10};
    int maxNumRet;
    bool maxNumRetBool = findMaxNum(maxNum,10,&maxNumRet);