题解 | #数组中出现次数超过一半的数字#

class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {
        int cnt = 0;//票数
        int res = 0;//最终返回的结果 //出现次数最多的数字
        for(int i = 0; i < numbers.size(); i++){
            if(cnt == 0) res = numbers[i];
            cnt += (res == numbers[i]) ? 1 : -1;
        }
        //cout << res << endl; //2
        
        //检查res出现的次是否超过了数组长度的一半
        int ciShu = 0;
        for(int i = 0; i <numbers.size(); i++){
            if(res == numbers[i]) ciShu++;
            if(ciShu > (numbers.size() / 2)) return res;
        }
        
        return 0;
    }
};