Class Solution
java.lang.Object
g1201_1300.s1287_element_appearing_more_than_25_in_sorted_array.Solution
1287 - Element Appearing More Than 25% In Sorted Array\.
Easy
Given an integer array **sorted** in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time, return that integer.
**Example 1:**
**Input:** arr = [1,2,2,6,6,6,6,7,10]
**Output:** 6
**Example 2:**
**Input:** arr = [1,1]
**Output:** 1
**Constraints:**
*
1 <= arr.length <= 104
* 0 <= arr[i] <= 105-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
findSpecialInteger
public int findSpecialInteger(int[] arr)
-