1.该题求出现次数超过一半的元素,故采用moore voting算法,moore投票法
2.遇到不同的元素,如果出现次数为0,更跟换成当前元素,如果次数不为0则-1,
3.遇到相同元素,出现次数相加
4.最终记录的元素就是所求元素
//#include<string>
//#include<stack>
//#include<unordered_set>
//#include <sstream>
//#include "func.h"
//#include <list>
#include <iomanip>
#include<unordered_map>
#include<set>
#include<queue>
#include<map>
#include<vector>
#include <algorithm>
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory.h>
#include<limits.h>
#include<stack>
using namespace std;
int main(void)
{
int m, n;
cin >> m >> n;
int count = 0, color = -1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
int tmpColor;
scanf("%d", &tmpColor);
if (color != tmpColor)
{//元素不同
if (count == 0)//更新元素
color = tmpColor;
else
count--;
}
else//元素相同,出现次数累加
count++;
}
}
cout << color << endl;
return 0;
}