mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
17 lines
519 B
HTML
17 lines
519 B
HTML
|
<p>数组<code>nums</code>包含从<code>0</code>到<code>n</code>的所有整数，但其中缺了一个。请编写代码找出那个缺失的整数。你有办法在O(n)时间内完成吗？</p>
|
|||
|
|
|
|||
|
|
<p><strong>注意：</strong>本题相对书上原题稍作改动</p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong>[3,0,1]
|
|||
|
|
<strong>输出：</strong>2</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong>[9,6,4,2,3,5,7,0,1]
|
|||
|
|
<strong>输出：</strong>8
|
|||
|
|
</pre>
|