Single Number
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.
Single Number
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.
Example 1
Input: nums = [2,2,1] Output: 1
Example 2
Input: nums = [4,1,2,1,2] Output: 4
Show hint
Use XOR operation: XOR all numbers. Since a XOR a = 0 and a XOR 0 = a, the result will be the single number.
Sign in to submit, save progress and mark problems as solved. You can still run your code.
Loading editor...
nums =
[2,2,1]
Expected
1