Sword To Offer 028 - 数组中出现次数超过一半的数字

class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {
        if(numbers.empty()) {
            return 0;
        }
        int temp = numbers[0];
        int count = 1;
        for(int i = 1; i < numbers.size(); i++) {
            numbers[i] == temp ? count++ : count--;
            if(count == 0) {
                temp = numbers[i];
                count = 1;
            }
        }
        count = 0;
        for (int number : numbers) {
            count += temp == number;
        }
        return count > numbers.size() / 2 ? temp : 0;
    }
};