题目描述:Single NumbererⅢ
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:
1. The order of the result is not important. So in the above example, [5, 3] is also correct.
2. Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
思路:这一次我们来到了第三个single number的问题,这一次仍然是想通过位运算来完成这个问题,核心工作就是找出分离出这两个不同的数的方法,因为一旦这两个数被分开了,那么我们就能通过第一次用的异或运算来求出这两个数。但是如何找出这两个数呢?思路是这样的,我们可以先对整个数进行一次异或操作,那么只剩下这两个不同的数的异或对吧,然后我们可以把这个结果和它的相反数进行与操作,最后我们遍历整个数组,分别与上面得到的结果进行与操作,把结果等于0的全部异或起来,结果不等于0的也异或起来,这样得到的两个数就是需要求的两个数。
流程图:
代码:
class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
int diff = accumulate(nums.begin(),nums.end(),0,bit_xor<int>());
diff &= -diff;
vector<int> res = {0,0};
for(int i:nums)
{
if((i & diff) == 0)
{
res[0] ^= i;
}
else
{
res[1] ^= i;
}
}
return res;
}
};
复杂度: O(n)
运行时间: