1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 19:46:47 +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,21 @@
<p>You are given an array with all the numbers from 1 to N appearing exactly once, except for two number that is missing. How can you find the missing number in O(N) time and 0(1) space?</p>
<p>You can return the missing numbers in any order.</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</strong> <code>[1]</code>
<strong>Output: </strong>[2,3]</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong>Input:</strong> <code>[2,3]</code>
<strong>Output: </strong>[1,4]</pre>
<p><strong>Note: </strong></p>
<ul>
<li><code>nums.length &lt;=&nbsp;30000</code></li>
</ul>