mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 19:31:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
@@ -0,0 +1,18 @@
|
||||
<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>
|
Reference in New Issue
Block a user