iven 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) {
vector<int> result;
int n = nums.size();
int a = 0;
for (int i = 0; i < n; i++)
{
a ^= nums[i];
}
int b = 1;
while ((b&a) == 0)
{
b <<= 1;
}
int c = 0;
int d = 0;
for (int i = 0; i < n; i++)
{
if ((nums[i]&b) != 0)
{
c ^= nums[i];
}
else
{
d ^= nums[i];
}
}
result.push_back(c);
result.push_back(d);
return result;
}
};