剑指offer：数组中出现次数超过一半的数字

class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {
        if(numbers.size()<=0) return 0;
        if(numbers.size()==1) return numbers[0];
        int flag = 1;
        int index = -1;
        int max = 0;
        for(int i=0;i<numbers.size()-1;i++){
            if(numbers[i] == numbers[i+1]){
                flag++;
                if(flag > max&&flag>1)
                    index = i;
            }else{
                flag = 0;
            }
        }
        if(index == -1)
            return 0;
        else
            return numbers[index];
    }
};