If there is a number in the C + + array that appears more than half the length of the array, find this number. (Ox-Guest sword refers to offer)

If there is a number in the array that appears more than half the length of the array, find this number. For example, enter an array of length 9 {1,2,3,2,2,2,5,4,2}. Since the number 2 appears in the array 5 times, which exceeds half the length of the array, the output is 2.  #include <iostream>using namespace Std;int grial (int a[],int n) {if (n==0) return-1;int flog = n/2;int i = 0;int count = 0;for (; i<n;i++) {for (int J =i;j<n;j++) {if (a[i]==a[j]) count++;} if (Count>flog) return a[i];else count = 0;} return 0;} int main () {int a[]={1,1,1,12,3};cout<<grial (a,5) <<endl;return 0;}

If there is a number in the C + + array that appears more than half the length of the array, find this number. (Ox-Guest sword refers to offer)