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 len = nums.size();
vector<int> v;
int i,t=0;
int m=0,n=0;
for(i=0;i<len;i++)
{
t^=nums[i];
}
t=t^(t-1)&t;
for(i=0;i<len;i++)
{
if(nums[i]&t)
m=m^nums[i];
}
for(i=0;i<len;i++)
{
if(!(nums[i]&t))
n=n^nums[i];
}
v.push_back(m);
v.push_back(n);
return v;
}
};