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?

方法一：用位操作

class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
       vector<int> res={0,0};
       int diff=0;
       for(int num:nums)           //得到只出现一次的两数的异或值
            diff^=num;
       diff &= -diff;             // 或者 diff &= ~(diff-1); 得到diff的最右的‘1’，假设此位叫‘diff’位
       for(int num:nums){
           if((num & diff)==0)    // 按‘diff’位是0，是1，把整个nums分为两类，只出现一次的两数分别在两类里
                res[0]^=num;
            else
                res[1]^=num;
       }
       return res;
    }
};

方法二：用map

class Solution {
public:
    vector<int> singleNumber(const vector<int>& nums) {
        unordered_map<int, unsigned> m;
        for(auto e : nums)
            m[e]++;
        vector<int> v;
        for(auto e : m)
            if(e.second == 1)
                v.push_back(e.first);
        return v;
    }
};