JZ28 数组中出现次数超过一半的数字

这道题最简单的方法是摩尔投票法：https://leetcode-cn.com/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/solution/mian-shi-ti-39-shu-zu-zhong-chu-xian-ci-shu-chao-3/

代码如下：
 

public class Solution {
    public int MoreThanHalfNum_Solution(int [] array) {
        int len = array.length;
        int x = 0, votes = 0;
        for(int num: array) {
            if(votes == 0){
                x = num;
            }
            votes += x == num ? 1 : -1; 
        }
        // Verify
        int count = 0;
        for(int num: array){
            if(num == x){
                count++;
            }
        }
        return 2 * count > len ? x : 0;
    }
}