Single Number
easyGiven 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
Explanation: 1 is the only element that appears once.
Example 2
Input: nums = [4,1,2,1,2]
Output: 4
Explanation: 4 is the only element that appears once.
Example 3
Input: nums = [1]
Output: 1
Explanation: There is only one element, so it is the single number.
Constraints
1 <= nums.length <= 3 * 10^4-3 * 10^4 <= nums[i] <= 3 * 10^4Each element in the array appears twice except for one element which appears only once.
Loading editor...
Test Cases
Click "Run" to execute your code against test cases
← PreviousNext →