Single Number III问题及解法

最新推荐文章于 2018-07-11 14:52:20 发布

我们要爱学习

最新推荐文章于 2018-07-11 14:52:20 发布

阅读量210

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium

本文链接：https://blog.csdn.net/u011809767/article/details/77488107

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

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.

示例：

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?

问题分析：

通过异或，可得两个只出现一次的值a和b的异或值，然后我们利用异或值把原数组分成两组，每组分别异或，最终可得答案。

过程详见代码：

class Solution {
public:
	vector<int> singleNumber(vector<int>& nums) {
		int diff = accumulate(nums.begin(),nums.end(),0,bit_xor<int>());
		diff &= -diff; // 找到两者按位异或为1的某一位，其余位置0
		vector<int> res = {0,0};
		for (int num : nums)
		{
			if ((num & diff) == 0) // 分组
			{
				res[0] ^= num;
			}
			else res[1] ^= num;
		}
		return res;
	}
};