1287. Element Appearing More Than 25% In Sorted Array

Posted 热带雨林

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了1287. Element Appearing More Than 25% In Sorted Array相关的知识,希望对你有一定的参考价值。

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
class Solution {
    public int findSpecialInteger(int[] arr) {
         int cur = 0, max = 0, res = 0;
        if(arr.length == 1) return arr[0];
        if(arr == null || arr.length == 0) return 0;
        for(int i = 0; i < arr.length - 1; i++){
            if(arr[i] == arr[i+1]){
                cur++;
            }
            else cur = 0;
            if(cur > max){
                max = cur;
                res = arr[i];
            }
        }
        System.out.println(max);
        return res;
    }
}

HashMap也行,就是有点慢

以上是关于1287. Element Appearing More Than 25% In Sorted Array的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode --- 1287. Element Appearing More Than 25% In Sorted Array 解题报告

LeetCode 5126. 有序数组中出现次数超过25%的元素 Element Appearing More Than 25% In Sorted Array

[排列组合 球盒 第二类Stirling数] P1287 盒子与球

1287 加农炮

最小生成树模板题POJ - 1287-prim+kruskal

51NOD1287加农炮