Leetcode 260 level 2

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?

Note :

That is an advanced version of the . But compared to that one, this is a more completed version of the situation. In this set, there are two different numbers included. My first thought was to do exactly what the I did in the . And iterate the whole vector one more time, report the item when the result of exclusive operation appears. However, things do not go like I planned. Since the many pairs of numbers could have the same result of exclusive operation. Therefore, I could not confirm whether the result is exactly that I expect.

My method did not go well. So I marked this as a level-2 problem. The right solution is, to divide the vector into two parts, each of which contains only one appear-once number. It's a easy thought. But how to divide is still a big problem. The right solution is to use the result of the exclusive operation. In binary representation, all numbers could be easily separated into two groups by checking whether its specific digit is zero or not. To divide the two appear-one numbers into different numbers. We just need to use the digit which is different between two appear-one numbers.

So the solution is firstly, get the result of the exclusive operation. And then, find a 1 digit in the result. Divide the vector into two new vector using that 1 digit. Apply the exclusive operation in two new vectors.

Answer :

class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
        int result=0;
        vector<int> ans;
        for(std::vector<int>::iterator i=nums.begin();i!=nums.end();++i){
            result^=(*i);
        }
        int flag = 0x01;
        while((flag&result)==0){
            flag <<= 1;
        }
        int res1=0,res2=0;
        for(std::vector<int>::iterator i=nums.begin();i!=nums.end();++i){
            if(flag&(*i)){
                res1^=(*i);
            }
            else{
                res2^=(*i);
            }
        }
        ans.push_back(res1);
        ans.push_back(res2);
        return ans;
    }
};