int moore_voting(vector<int> &num){int curIdx = 0, count = 1;//num[curIdx]暂存次数最多元素for (int i = 1; i < num.size(); ++i){num[i] == num[curIdx] ? ++count : --count;//--count就是移除了if (!count)
{curIdx = i;
count = 1;}}return num[curIdx];原文：https://www.cnblogs.com/goulingtao/p/11246412.html