【剑指offer】面试题29：数组中出现次数超过一半的数字

class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {
        if(numbers.size()==0)  return 0;//好吧，OJ说这里应该为0
        
        int res=numbers[0];
        int cnt=1;
        
        for(int i=1;i<numbers.size();++i)
        {
            if(numbers[i]==res) cnt++;
            else
            {
                if(cnt) cnt--;
                else//次数为0时
                {
                    res=numbers[i];
                    cnt++;
                }
            }
        }
        
        if(CheckMoreThanHalf(numbers,res))  return res;
        else return 0;
    }
private:
    bool CheckMoreThanHalf(vector<int> numbers, int res)
    {
        int count=0;
        for(int i=0;i<numbers.size();++i)
        {
            if(numbers[i]==res) count++;
        }
        
        if(count>numbers.size()/2)  return true;
        else return false;
    }
};