Boyer–Moore majority vote algorithm(摩尔投票算法)

Boyer–Moore majority vote algorithm
摩尔投票算法
Leetcode15: https://leetcode.com/problems/majority-element/ , 计算众数， 可以使用boyer-moore majority 算法：

    public int majorityElement(int[] nums) {

        int major=nums[0], count = 1;
        for(int i=1; i