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) {
int xorSum=0;
for(int i=0;i<nums.size();++i)
xorSum^=nums[i];
int j;
for(j=0;j<sizeof(xorSum)*8;++j){
if(xorSum>>j&1==1)
break;
}
vector<int> ret;
int a=0,b=0;
for(int i=0;i<nums.size();++i){
if(nums[i]>>j&1==1)
a^=nums[i];
else
b^=nums[i];
}
ret.push_back(a);
ret.push_back(b);
return ret;
}
};