Advertisement
1287. Element Appearing More Than 25% In Sorted Array
EasyView on LeetCode
1287.cs
C#
public class Solution
{
public int FindSpecialInteger(int[] arr)
{
int n = arr.Length;
int quarter = n / 4;
for (int i = 0; i < n - quarter; ++i)
{
if (arr[i] == arr[i + quarter])
return arr[i];
}
throw new ArgumentException();
}
}Advertisement
Was this solution helpful?