[LeetCode][JavaScript]Single Number III

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:

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?

https://leetcode.com/problems/single-number-iii/

 

 

---

 

 

又是奇妙的位运算。

https://leetcode.com/discuss/52351/accepted-java-space-easy-solution-with-detail-explanations

第一轮遍历利用异或去掉出现两次的数，留下两个出现一次数的异或。

由于两个数不同，异或的结果中肯定有一位是1。

再遍历输入数组的时候，把输入的数与这一位做与运算，根据结果是否为零，可以把数组分为两份。

结果的两个数会被分开，异或去掉出现两次的数，最后得出答案。

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var singleNumber = function(nums) {
    var two = 0, i;
    for(i = 0; i < nums.length; i++){
        two ^= nums[i];
    }
    var pos = 1;
    two = two.toString(2);
    for(i = two.length - 1; i >= 0; i--){
        if (two[i] === '1'){
            break;
        }
        pos *= 2;
    }
    var half1 = 0, half2 = 0;
    for(i = 0; i < nums.length; i++){
        if(nums[i] & pos){
            half1 ^= nums[i];
        }else{
            half2 ^= nums[i];
        }
    }
    return [half1, half2];
};