missing-number

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an array <code>nums</code> containing <code>n</code> distinct numbers in the range <code>[0, n]</code>, return the only number in the range that is missing from the array.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [3,0,1]

Output: 2

Explanation:

<code>n = 3</code> since there are 3 numbers, so all numbers are in the range <code>[0,3]</code>. 2 is the missing number in the range since it does not appear in <code>nums</code>.
</div>

Example 2:

<div class="example-block">
Input: nums = [0,1]

Output: 2

Explanation:

<code>n = 2</code> since there are 2 numbers, so all numbers are in the range <code>[0,2]</code>. 2 is the missing number in the range since it does not appear in <code>nums</code>.
</div>

Example 3:

<div class="example-block">
Input: nums = [9,6,4,2,3,5,7,0,1]

Output: 8

Explanation:

<code>n = 9</code> since there are 9 numbers, so all numbers are in the range <code>[0,9]</code>. 8 is the missing number in the range since it does not appear in <code>nums</code>.
</div>

<div class="simple-translate-system-theme" id="simple-translate">
<div>
<div class="simple-translate-button isShow" style="background-image: url(&quot;moz-extension://8a9ffb6b-7e69-4e93-aae1-436a1448eff6/icons/512.png&quot;); height: 22px; width: 22px; top: 318px; left: 36px;">&nbsp;</div>

<div class="simple-translate-panel " style="width: 300px; height: 200px; top: 0px; left: 0px; font-size: 13px;">
<div class="simple-translate-result-wrapper" style="overflow: hidden;">
<div class="simple-translate-move" draggable="true">&nbsp;</div>

<div class="simple-translate-result-contents">
&nbsp;

&nbsp;
</div>
</div>
</div>
</div>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>1 &lt;= n &lt;= 104</code></li>
	<li><code>0 &lt;= nums[i] &lt;= n</code></li>
	<li>All the numbers of <code>nums</code> are unique.</li>
</ul>

&nbsp;
Follow up: Could you implement a solution using only <code>O(1)</code> extra space complexity and <code>O(n)</code> runtime complexity?

missingNumber

Missing Number

First Missing Positive

first-missing-positive

缺失的第一个正数

Single Number

single-number

只出现一次的数字

Find the Duplicate Number

find-the-duplicate-number

寻找重复数

Couples Holding Hands

couples-holding-hands

情侣牵手

Find Unique Binary String

find-unique-binary-string

找出不同的二进制字符串

Find the Largest Almost Missing Integer

find-the-largest-almost-missing-integer

找出最大的几近缺失整数

Bit Manipulation

Array

Hash Table

Math

Binary Search

Sorting

&#32473;&#23450;&#19968;&#20010;&#21253;&#21547; <code>[0, n]</code>&nbsp;&#20013;&nbsp;<code>n</code>&nbsp;&#20010;&#25968;&#30340;&#25968;&#32452; <code>nums</code> &#65292;&#25214;&#20986; <code>[0, n]</code> &#36825;&#20010;&#33539;&#22260;&#20869;&#27809;&#26377;&#20986;&#29616;&#22312;&#25968;&#32452;&#20013;&#30340;&#37027;&#20010;&#25968;&#12290;

<ul>
</ul>

&nbsp;

&#31034;&#20363; 1&#65306;

<div class="example-block">
&#36755;&#20837;&#65306;nums = [3,0,1]

&#36755;&#20986;&#65306;2

&#35299;&#37322;&#65306;<code>n = 3</code>&#65292;&#22240;&#20026;&#26377; 3 &#20010;&#25968;&#23383;&#65292;&#25152;&#20197;&#25152;&#26377;&#30340;&#25968;&#23383;&#37117;&#22312;&#33539;&#22260; <code>[0,3]</code> &#20869;&#12290;2 &#26159;&#20002;&#22833;&#30340;&#25968;&#23383;&#65292;&#22240;&#20026;&#23427;&#27809;&#26377;&#20986;&#29616;&#22312; <code>nums</code> &#20013;&#12290;
</div>

&#31034;&#20363; 2&#65306;

<div class="example-block">
&#36755;&#20837;&#65306;nums = [0,1]

&#36755;&#20986;&#65306;2

&#35299;&#37322;&#65306;<code>n = 2</code>&#65292;&#22240;&#20026;&#26377; 2 &#20010;&#25968;&#23383;&#65292;&#25152;&#20197;&#25152;&#26377;&#30340;&#25968;&#23383;&#37117;&#22312;&#33539;&#22260; <code>[0,2]</code> &#20869;&#12290;2 &#26159;&#20002;&#22833;&#30340;&#25968;&#23383;&#65292;&#22240;&#20026;&#23427;&#27809;&#26377;&#20986;&#29616;&#22312; <code>nums</code> &#20013;&#12290;
</div>

&#31034;&#20363; 3&#65306;

<div class="example-block">
&#36755;&#20837;&#65306;nums = [9,6,4,2,3,5,7,0,1]

&#36755;&#20986;&#65306;8

&#35299;&#37322;&#65306;<code>n = 9</code>&#65292;&#22240;&#20026;&#26377; 9 &#20010;&#25968;&#23383;&#65292;&#25152;&#20197;&#25152;&#26377;&#30340;&#25968;&#23383;&#37117;&#22312;&#33539;&#22260; <code>[0,9]</code> &#20869;&#12290;8 &#26159;&#20002;&#22833;&#30340;&#25968;&#23383;&#65292;&#22240;&#20026;&#23427;&#27809;&#26377;&#20986;&#29616;&#22312; <code>nums</code> &#20013;&#12290;
</div>

&#25552;&#31034;&#65306;

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>1 &lt;= n &lt;= 104</code></li>
	<li><code>0 &lt;= nums[i] &lt;= n</code></li>
	<li><code>nums</code> &#20013;&#30340;&#25152;&#26377;&#25968;&#23383;&#37117; &#29420;&#19968;&#26080;&#20108;</li>
</ul>

&nbsp;

&#36827;&#38454;&#65306;&#20320;&#33021;&#21542;&#23454;&#29616;&#32447;&#24615;&#26102;&#38388;&#22797;&#26434;&#24230;&#12289;&#20165;&#20351;&#29992;&#39069;&#22806;&#24120;&#25968;&#31354;&#38388;&#30340;&#31639;&#27861;&#35299;&#20915;&#27492;&#38382;&#39064;?

Sunbelt Computer Software

PL/B Language Development and Support