1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions

View File

@@ -0,0 +1,18 @@
<p>An array&nbsp;contains all the integers from 0 to n, except for one number which is missing.&nbsp; 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>&nbsp;</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>