mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
19 lines
536 B
HTML
19 lines
536 B
HTML
<p>An array contains all the integers from 0 to n, except for one number which is missing. Write code to find the missing integer. Can you do it in O(n) time?</p>
|
|
|
|
<p><strong>Note: </strong>This problem is slightly different from the original one the book.</p>
|
|
|
|
<p><strong>Example 1: </strong></p>
|
|
|
|
<pre>
|
|
<strong>Input: </strong>[3,0,1]
|
|
<strong>Output: </strong>2</pre>
|
|
|
|
<p> </p>
|
|
|
|
<p><strong>Example 2: </strong></p>
|
|
|
|
<pre>
|
|
<strong>Input: </strong>[9,6,4,2,3,5,7,0,1]
|
|
<strong>Output: </strong>8
|
|
</pre>
|