过半数ID查找

//通过一对对删除不同的数来找出超过一半的数究竟是哪一个

#include <iostream>

using namespace std;

int Find(int [], int);

int main()

{

int a[200];

for(int i = 0; i < 10; i++)

for(int j = 0; j < 10; j++)

a[i * 10 + j] = j;

for(int i = 100; i < 200; i++)

a[i] = 1;

cout<<"result = "<<Find(a, 200)<<endl;

int n;

cin>>n;

return 0;

}

int Find(int a[], int N)

{

int candidate;

int nTimes = 0;

int i = 0;

for(; i < N; i++)

{

if(nTimes == 0)

{

candidate = a[i];

}

else

{

if(candidate == a[i])

nTimes++;

else

nTimes--;

}

}

return candidate;

}