194. Single Number III
MediumBit Manipulation
Given an integer array `nums`, 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 algorithm that runs in linear runtime complexity and uses only constant extra space.
Examples
Input: [1,2,1,3,2,5]
Output: [3,5]
Explanation: XOR of all = 6; splitting by its lowest set bit recovers 3 and 5, the two singletons.
Constraints
- 2 <= nums.length <= 3 * 10^4
- -2^31 <= nums[i] <= 2^31 - 1
- Each integer in nums will appear twice, only two integers will appear once.
Loading...
Run checks all cases above. Submit evaluates all test cases.