LeetCode[260]Single Number III

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?

从异或结果res中提取的最低位是两个唯一元素最低的不同位，即mask，用此位去分别与数组中的该位与掩码相同的元素异或的到res1，在将res与res1相与得到结果res2，得解。

class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
        int res = 0;
        for (int i = 0; i < nums.size(); ++i){
            res ^= nums[i];
        }

        int mask = 1;
        // '(res & mask) == 0'中一定要有括号，否则结合顺序有问题，但是查优先级又并没有问题，很迷。
        while ((res & mask) == 0){
            mask <<= 1;
        }

        int res1 = 0;
        for (int i = 0; i < nums.size(); ++i){
            if ((nums[i] & mask) != 0){
                res1 ^= nums[i];
            }
        }

        int res2 = res ^ res1;
        return *new vector<int>{res1, res2};
    }
};