coder-xiaomo/leetcode-problemset
1
0
Fork 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

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
leetcode-cn/problem (English)/消失的两个数字(English) [missing-two-lcci].html
View File

@@ -1,21 +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>
<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>