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
Constraints:
1 <= arr.length <= 10^4
0 <= arr[i] <= 10^5
题解:
连续的数组那么出现25%的肯定有num[i] = num[i + n / 4]
class Solution {
public:
int findSpecialInteger(vector<int>& arr) {
int n = arr.size();
int k = n / 4;
for (int i = 0; i < n - k; i++) {
if (arr[i] == arr[i + k]) {
return arr[i];
}
}
return -1;
}
};