gistfile1.cs

 1 using System;
 2 class Solution {
 3     public int solution(int[] A) {
 4         int n = A.Length;
 5         int[] L = new int[n + 1];
 6         L[0] = -1;
 7         for (int i = 0; i < n; i++) {
 8             L[i + 1] = A[i];
 9         }
10         int count = 0;
11         int pos = (n + 1) / 2;
12         int candidate = L[pos];
13         for (int i = 1; i <= n; i++) {
14             if (L[i] == candidate)
15                 count = count + 1;
16         }
17         if (count > pos)
18             return candidate;
19         return (-1);
20     }
21 }