代码片段:
int MoreThanHalfNum_Solution(vector<int> numbers) {
int length = numbers.size();
if(length<=0){
return 0;
}
//判断数组中哪个数出现的频率最高
int num = numbers[0],count =1;
for (int i=1;i<length;i++){
if(num==numbers[i]){
count++;
}
else{
count--;
}
if(count ==0){
num=numbers[i];
count =1;
}
}
return num;
}