the-two-sneaky-numbers-of-digitville

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

In the town of Digitville, there was a list of numbers called <code>nums</code> containing integers from <code>0</code> to <code>n - 1</code>. Each number was supposed to appear exactly once in the list, however, two mischievous numbers sneaked in an additional time, making the list longer than usual.

As the town detective, your task is to find these two sneaky numbers. Return an array of size two containing the two numbers (in any order), so peace can return to Digitville.

&nbsp;
Example 1:

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

Output: [0,1]

Explanation:

The numbers 0 and 1 each appear twice in the array.
</div>

Example 2:

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

Output: [2,3]

Explanation: 

The numbers 2 and 3 each appear twice in the array.
</div>

Example 3:

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

Output: [4,5]

Explanation: 

The numbers 4 and 5 each appear twice in the array.
</div>

&nbsp;
Constraints:

<ul>
	<li data-stringify-border="0" data-stringify-indent="1"><code>2 &lt;= n &lt;= 100</code></li>
	<li data-stringify-border="0" data-stringify-indent="1"><code>nums.length == n + 2</code></li>
	<li data-stringify-border="0" data-stringify-indent="1"><code data-stringify-type="code">0 &lt;= nums[i] &lt; n</code></li>
	<li data-stringify-border="0" data-stringify-indent="1">The input is generated such that <code>nums</code> contains exactly two repeated elements.</li>
</ul>

getSneakyNumbers

The Two Sneaky Numbers of Digitville

Find All Duplicates in an Array

find-all-duplicates-in-an-array

数组中重复的数据

Array

Hash Table

Math

数字小镇 Digitville 中，存在一个数字列表 <code>nums</code>，其中包含从 <code>0</code> 到 <code>n - 1</code> 的整数。每个数字本应 只出现一次，然而，有 两个 顽皮的数字额外多出现了一次，使得列表变得比正常情况下更长。

为了恢复 Digitville 的和平，作为小镇中的名侦探，请你找出这两个顽皮的数字。

返回一个长度为 2 的数组，包含这两个数字（顺序任意）。

&nbsp;

示例 1：

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

输出： [0,1]

解释：

数字 0 和 1 分别在数组中出现了两次。
</div>

示例 2：

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

输出： [2,3]

解释: 

数字 2 和 3 分别在数组中出现了两次。
</div>

示例 3：

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

输出： [4,5]

解释: 

数字 4 和 5 分别在数组中出现了两次。
</div>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= n &lt;= 100</code></li>
	<li><code>nums.length == n + 2</code></li>
	<li><code>0 &lt;= nums[i] &lt; n</code></li>
	<li>输入保证 <code>nums</code> 中 恰好 包含两个重复的元素。</li>
</ul>