[LeetCode] 260. Single Number III

题：https://leetcode.com/problems/single-number-iii/description/

题目

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.

Example:

Input:  [1,2,1,3,2,5]
Output: [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?

题目大意

找出数组中不重复的两个元素

思路

从 题268. Missing Number 可知 a^ b^ b = a。

若nums中不同的元素分别为 a，b，那么对所有元素进行 xor，可得a^b。由于 a != b ，a ^ b 至少有一位为1。

然后根据 该位是否为1，将nums分为两组，a ，b 必不在同一组中，且相同的元素必在同一组。那么两组内所有元素做xor操作，一组的结果 为 a，另一组的为b。

class Solution {
    public int[] singleNumber(int[] nums) {
        int diff = 0 ;
        for(int num:nums)
            diff^=num;
        int flag = 1;
        while((flag&diff)==0)
            flag = flag<<1;
        int[] res = {0,0};
        for(int num:nums){
            if((flag&num)==0)
                res[0]^=num;
            else
                res[1]^=num;
        }
        return res;
    }
}

更简单求 最右位为 1 的方法。
diff求负： 从最低位 找第一个为1的位i，后面的位都取反。
diff & (-diff) 为 位i为1，其他位都为0 的数。

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