赠书 | 异步2周年,技术图书免费选 每周荐书：渗透测试、K8s、架构（评论送书） 项目管理+代码托管+文档协作，开发更流畅

【leetcode】Single Number III

2015-11-19 20:01 154人阅读评论(0) 收藏举报

分类：

算法（12）

作者同类文章X

练习（18）

作者同类文章X

C++（13）

作者同类文章X

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 AxorB = 0;
        for (vector<int>::iterator it = nums.begin(); it != nums.end(); ++it)
        {
            AxorB = AxorB ^ (*it);
        }
        
        int A = 0;
        int B = 0;
        int mask = AxorB & (-AxorB);
        for (vector<int>::iterator it = nums.begin(); it != nums.end(); ++it)
        {
            if ((mask & (*it)) == 0)
                A = A ^ (*it);
            else
                B = B ^ (*it);
        }
        
        vector<int> result;
        result.push_back(A);
        result.push_back(B);
        return result;
    }
};

Personal Note：