Difficulty: Medium
Given an array of numbers 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.
For example:
Given nums = [1, 2, 1, 3, 2, 5]
, return [3, 5]
.
Note:
- The order of the result is not important. So in the above example,
[5, 3]
is also correct. - Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
if(nums.empty())
return vector<int>();
int temp=0;
for(auto &e:nums)
temp^=e;
int i;
for(i=0;i<31;++i)
if(temp&(1<<i))
break;
vector<int> res(2,0);
for(auto &e:nums){
if(e&(1<<i))
res[0]^=e;
else
res[1]^=e;
}
return res;
}
};