找水王

#include<iostream>
using namespace std;
 
 int Find(int num[], int n)
{
    int i,index = 0,k = 0;
    for (i = 0; i < n; i++)
    {
        if (k== 0)
        {
            index = num[i];
            k= 1;
        }
        else
        {
            if (index == num[i])
            {
                k++;
            }
            else
            {
                k--;
            }
        }
    }
    return index;
}
  
int main()
{
    int num, shui;
    int arr[] = {1,2,2,4,5,2,2,2,4,3,2,2,2,5};
    num = sizeof(arr)/sizeof(int);
    shui = Find(arr, num);
    cout<<"水王是"<<shui<<endl;
}