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

36
leetcode-cn/problem (English)/消失的数字(English) [missing-number-lcci].html
View File

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