coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 03:56:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

20
leetcode-cn/problem (Chinese)/0～n-1中缺失的数字 [que-shi-de-shu-zi-lcof].html Normal file
View File

@@ -0,0 +1,20 @@
<p>一个长度为n-1的递增排序数组中的所有数字都是唯一的，并且每个数字都在范围0～n-1之内。在范围0～n-1内的n个数字中有且只有一个数字不在该数组中，请找出这个数字。</p>
<p>&nbsp;</p>
<p><strong>示例 1:</strong></p>
<pre><strong>输入:</strong> [0,1,3]
<strong>输出:</strong> 2
</pre>
<p><strong>示例&nbsp;2:</strong></p>
<pre><strong>输入:</strong> [0,1,2,3,4,5,6,7,9]
<strong>输出:</strong> 8</pre>
<p>&nbsp;</p>
<p><strong>限制：</strong></p>
<p><code>1 &lt;= 数组长度 &lt;= 10000</code></p>