123. Single Number

EasyBit Manipulation

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: [4,1,2,1,2]

Output: 4

Explanation: 1 and 2 each appear twice and cancel; 4 appears once and remains.

Constraints

  • 1 <= nums.length <= 3 * 10^4
  • -3 * 10^4 <= nums[i] <= 3 * 10^4
  • Each element in the array appears twice except for one element which appears once.
Loading...

Run checks all cases above. Submit evaluates all test cases.