single-number-iii

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 integer array <code>nums</code>, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in any order.

You must write an&nbsp;algorithm that runs in linear runtime complexity and uses&nbsp;only constant extra space.

&nbsp;
Example 1:

<pre>
Input: nums = [1,2,1,3,2,5]
Output: [3,5]
Explanation: [5, 3] is also a valid answer.
</pre>

Example 2:

<pre>
Input: nums = [-1,0]
Output: [-1,0]
</pre>

Example 3:

<pre>
Input: nums = [0,1]
Output: [1,0]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 3 * 104</code></li>
	<li><code>-231 &lt;= nums[i] &lt;= 231 - 1</code></li>
	<li>Each integer in <code>nums</code> will appear twice, only two integers will appear once.</li>
</ul>

singleNumber

Single Number III

Single Number

single-number

只出现一次的数字

Single Number II

single-number-ii

只出现一次的数字 II

Find The Original Array of Prefix Xor

find-the-original-array-of-prefix-xor

找出前缀异或的原始数组

Find the XOR of Numbers Which Appear Twice

find-the-xor-of-numbers-which-appear-twice

求出出现两次数字的 XOR 值

Bit Manipulation

Array

给你一个整数数组&nbsp;<code>nums</code>，其中恰好有两个元素只出现一次，其余所有元素均出现两次。 找出只出现一次的那两个元素。你可以按 任意顺序 返回答案。

你必须设计并实现线性时间复杂度的算法且仅使用常量额外空间来解决此问题。

&nbsp;

示例 1：

<pre>
输入：nums = [1,2,1,3,2,5]
输出：[3,5]
解释：[5, 3] 也是有效的答案。
</pre>

示例 2：

<pre>
输入：nums = [-1,0]
输出：[-1,0]
</pre>

示例 3：

<pre>
输入：nums = [0,1]
输出：[1,0]
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= nums.length &lt;= 3 * 104</code></li>
	<li><code>-231 &lt;= nums[i] &lt;= 231 - 1</code></li>
	<li>除两个只出现一次的整数外，<code>nums</code> 中的其他数字都出现两次</li>
</ul>