寻找发帖水王

#include<iostream>
using namespace std;
int findWaterKing(int a[],int n)
{
	int candidate,times=0;
	for(int i=0;i!=n;i++)
	{
		if(times==0)
		{
			candidate=a[i];
			times++;
		}
		else
		{
			if(candidate==a[i])
			{
				times++;
			}
			else
			{
				times--;
			}
		}
	}
	return candidate;
}
int* findWaterKingPlus(int a[],int n)//扩展
{
	int *candidates=new int[3];
	int times[3]={0,0,0};
	for(int i=0;i!=n;i++)
	{
		if(times[0] && a[i]==candidates[0]) {times[0]++;continue;}
		if(times[1] && a[i]==candidates[1]) {times[1]++;continue;}
		if(times[2] && a[i]==candidates[2]) {times[2]++;continue;}
		//a[i]!= candidates 0 ,1 ,2
		if(times[0]==0) {candidates[0]=a[i];times[0]++;continue;}
		if(times[1]==0) {candidates[1]=a[i];times[1]++;continue;}
		if(times[2]==0) {candidates[2]=a[i];times[2]++;continue;}
		times[0]--,times[1]--,times[2]--;
	}
	return candidates;
}

int main()
{
	int a[]={278,109,278,278,102,9,278,10};
	int len=(sizeof(a)/sizeof(*a));
	int b[]={1,2,3,4,3,3,2,2,1,1,6,7,12,1,1,2,2,3,3};
	int len_b=(sizeof(b)/sizeof(*b));
	
	cout<<findWaterKing(a,len)<<endl;
	int *ret=findWaterKingPlus(b,len_b);
	for(int i=0;i!=3;i++)
	{
		cout<<ret[i]<<endl;
	}
	return 0;
}