數組中c出現次數超過一半的數字

#include<iostream>
using namespace std;

//最後出現1的肯定就是出現一半的字符 
int MoreThanhalfnum(int *numbers,int length){
	if(numbers == NULL || length<= 0) return 0;
	int result = numbers[0];
	int times = 1;
	for(int i=1;i<=length;++i){
		if(times == 0){
		 	result = numbers[i];
			times = 1;	
		}
		if(result == numbers[i]){
			times ++;
		}else{
			times --;
		}
	}
	if(!check(numbers,length,result)) return 0;
	
	return result; 
}

bool check(int *numbers,int length,int result){
	int sum = 0;
	for(int i=0;i<=length;++i){
		 if(numbers[i] == result){
		 	sum ++;
		 }
	}
	if(sum*2>length){
		return true;
	}else{
		return false;
	}
}