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

class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {
        if(numbers.size() == 0)
            return 0;
        int num = numbers[0], count = 1;
        for(int i = 1; i < numbers.size(); i++){
            if(numbers[i] != num){
                if((i ==( numbers.size() - 1) )&& count == 1){
                    num = 0;
                    break;
                }
                count --;
                if(count <=0){
                    num = numbers[i];
                    count = 1;   
                }
            }else{
                count ++;
            }
        }
        return num;
    }
};

 

来源：https://blog.csdn.net/perfects110/article/details/99691695