mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
21 lines
584 B
HTML
21 lines
584 B
HTML
|
<p>一个长度为n-1的递增排序数组中的所有数字都是唯一的，并且每个数字都在范围0～n-1之内。在范围0～n-1内的n个数字中有且只有一个数字不在该数组中，请找出这个数字。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入:</strong> [0,1,3]
|
|||
|
|
<strong>输出:</strong> 2
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入:</strong> [0,1,2,3,4,5,6,7,9]
|
|||
|
|
<strong>输出:</strong> 8</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>限制：</strong></p>
|
|||
|
|
|
|||
|
|
<p><code>1 <= 数组长度 <= 10000</code></p>
|