missing-number

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

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

给定一个包含 <code>[0, n]</code>&nbsp;中&nbsp;<code>n</code>&nbsp;个数的数组 <code>nums</code> ，找出 <code>[0, n]</code> 这个范围内没有出现在数组中的那个数。

<ul>
</ul>

&nbsp;

示例 1：

<div class="example-block">
输入：nums = [3,0,1]

输出：2

解释：<code>n = 3</code>，因为有 3 个数字，所以所有的数字都在范围 <code>[0,3]</code> 内。2 是丢失的数字，因为它没有出现在 <code>nums</code> 中。
</div>

示例 2：

<div class="example-block">
输入：nums = [0,1]

输出：2

解释：<code>n = 2</code>，因为有 2 个数字，所以所有的数字都在范围 <code>[0,2]</code> 内。2 是丢失的数字，因为它没有出现在 <code>nums</code> 中。
</div>

示例 3：

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

输出：8

解释：<code>n = 9</code>，因为有 9 个数字，所以所有的数字都在范围 <code>[0,9]</code> 内。8 是丢失的数字，因为它没有出现在 <code>nums</code> 中。
</div>

提示：

<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> 中的所有数字都 独一无二</li>
</ul>

&nbsp;

进阶：你能否实现线性时间复杂度、仅使用额外常数空间的算法解决此问题?