数组中出现次数超过一半的数字

实现一个函数，找出数组中出现次数超过一半的元素

思路:默认第一个元素为找到的元素result，设置times变量为1，遍历数组，如果后面的元素等于result，times加1，如果后面的元素不等于result，times减1，如果times为0，则把result替换为当前元素

C++

.h

#ifndef MoreThanHalf_hpp
#define MoreThanHalf_hpp

#include <stdio.h>

#endif /* MoreThanHalf_hpp */

int moreThanHalfNumber(int arr[], int length);

.cpp

#include "MoreThanHalf.h"

int moreThanHalfNumber(int arr[], int length){
    if (arr == NULL || length <=0 ) {
        return -1;
    }
    
    if (length == 1) {
        return arr[0];
    }
    
    int times = 1;
    int result = arr[0];
    for (int i = 1; i < length; i++) {
        if (times == 0) {
            result = arr[i];
            times = 1;
        } else if (arr[i] == result) {
            times++;
        } else {
            times--;
        }
    }
    
    //校验是否次数超过一半
    int resTimes = 0;
    for (int i = 0; i < length; i++) {
        if (arr[i] == result) {
            resTimes++;
        }
    }
    if (resTimes * 2 > length) {
        return  result;
    }
    return -1;
}

main

#include <iostream>
#include "MoreThanHalf.h"

int main(int argc, const char * argv[]) {
    int arr[8] = {1, 2, 2, 2, 2, 2, 3, 4};
    int result = moreThanHalfNumber(arr, 8);
    std::cout<<result<<std::endl;
    return 0;
}