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?


    和single numberII不同的是，该题有2个单独的元素。single numberII只有1个单独的元素。那么只需要所有元素异或，便能找到不同的那个元素
对于single numberIII异或所有元素后的值为2个不同元素的异或，如上题，即3^5 = 0011 ^ 0101 = 0110=6
    如何根据6找到对应的2个单独元素。我们想做的是区分那两个单独的元素a、b，如果我们将0110只保留最低位的1，其余值为零。因为1代表了 a、b第一个不同的位。那么a & 0010 != b & 0010。
    如何将0110只保留最低位的1，最直接的方法是取补码。如何取补码，只要将0110的符号位改成负数（计算机用补码表示，正数补码=原码），即0000 0110 变为 1111 1010 ，两者相与，即满足要求

public int[] singleNumber(int[] nums) {
    int[] res = new int[2];
    int diff = 0;
    for(int num : nums)
    {
        diff ^= num;
    }
    diff &= -diff;
    for(int num : nums)
    {
        if((num & diff) == 0)
        {
            res[0] ^= num;
        }else
        {
            res[1] ^= num;
        }
    }
    return res;

    }