mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
22 lines
630 B
HTML
22 lines
630 B
HTML
<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 <= 30000</code></li>
|
|
|
|
</ul>
|
|
|