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

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