element-appearing-more-than-25-in-sorted-array

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

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.

&nbsp;
Example 1:

<pre>
Input: arr = [1,2,2,6,6,6,6,7,10]
Output: 6
</pre>

Example 2:

<pre>
Input: arr = [1,1]
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= arr.length &lt;= 104</code></li>
	<li><code>0 &lt;= arr[i] &lt;= 105</code></li>
</ul>

第 15 场双周赛

biweekly-contest-15

findSpecialInteger

初级工程师

Element Appearing More Than 25% In Sorted Array

Array

给你一个非递减的&nbsp;有序&nbsp;整数数组，已知这个数组中恰好有一个整数，它的出现次数超过数组元素总数的 25%。

请你找到并返回这个整数

&nbsp;

示例：

<pre>
输入：arr = [1,2,2,6,6,6,6,7,10]
输出：6
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= arr.length &lt;= 10^4</code></li>
	<li><code>0 &lt;= arr[i] &lt;= 10^5</code></li>
</ul>