【Question】
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?
vector<int> singleNumber(vector<int>& nums) {
int temp=nums[0];
for(int i=1;i<nums.size();i++)
temp^=nums[i];
int key=temp;
int count=0;
while(key)
{
if(key%2==1)
{
count++;
break;
}
count++;
key/=2;
}
int first=temp;
for(int i=0;i<nums.size();i++)
{
int j=count;
int key1 = nums[i];
while(j-1)
{
key1/=2;
j--;
}
if(abs(key1%2)==1)
first^=nums[i];
}
int second=temp^first;
nums.clear();
nums.push_back(first);
nums.push_back(second);
return nums;
}