mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
22 lines
530 B
HTML
22 lines
530 B
HTML
<p>给你一个非递减的 <strong>有序 </strong>整数数组，已知这个数组中恰好有一个整数，它的出现次数超过数组元素总数的 25%。</p>
|
|
|
|
<p>请你找到并返回这个整数</p>
|
|
|
|
<p> </p>
|
|
|
|
<p><strong>示例：</strong></p>
|
|
|
|
<pre>
|
|
<strong>输入：</strong>arr = [1,2,2,6,6,6,6,7,10]
|
|
<strong>输出：</strong>6
|
|
</pre>
|
|
|
|
<p> </p>
|
|
|
|
<p><strong>提示：</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= arr.length <= 10^4</code></li>
|
|
<li><code>0 <= arr[i] <= 10^5</code></li>
|
|
</ul>
|