快速查找list中的大多数元素（数目超过一半的元素）

算法叫Moore's volting，用于线性查找list/vector/array中的majority元素，如果元素出现次数不足一半，不叫majority，不能使用该算法。

算法核心思想是majority元素可以抵消掉list中的其他元素，然后仍有剩余。

C++实现(输入为vector)

int majorityElement(vector<int> &num) {
        int count = 0;
        int majority_item = -1;
        for(int i=0;i<num.size();i++){
            if(num[i]==majority_item)
                count++;
            else if(count==0){
                count++;
                majority_item = num[i];
            }
            else
                count--;
        }
        return majority_item;

}

参考文献MJRTY - A Fast Majority Vote Algorithm, with R.S. Boyer. In R.S. Boyer (ed.), Automated Reasoning: Essays in Honorof Woody Bledsoe, Automated Reasoning Series, Kluwer Academic Publishers,Dordrecht, The Netherlands, 1991, pp. 105-117