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

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>