Single Number
Easy
Array
Bit Manipulation
XOR
Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space.
Examples:
Input:
[2,2,1]Output:
1Input:
[4,1,2,1,2]Output:
4Input:
[1]Output:
1Constraints:
- 1 ≤ nums.length ≤ 3 * 10⁴
- -3 * 10⁴ ≤ nums[i] ≤ 3 * 10⁴
- Each element in the array appears twice except for one element which appears only once.
Code Editor
Loading advanced editor...
Console Output
Ready to execute
Click "Run Code" to see your output here