Package g1201_1300.s1287_element_appearing_more_than_25_in_sorted_array

Class Solution

  • All Implemented Interfaces:
    
public final class 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:

    • <code>1 <= arr.length <= 10<sup>4</sup></code>

    • <code>0 <= arri<= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer findSpecialInteger(IntArray arr)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait