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?

题目分析
1，对所有的元素进行异或操作。异或得到的结果C为，A元素和B元素的异或结果，其他元素都消掉了。
2，异或结果减一，取反，再执行&操作。得到最右位两数不同的数。例如，5的二进制为0101,7的二进制为1001。异或的结果为1110 ，减一得到1101，取反为0010，&操作为0010，该数字的1为，5和7最右起第一个不想同的位。
3，直接 & 操作，异或即可找到，A和B。其他元素还是被消掉了

public class Solution {
    public int[] singleNumber(int[] nums) {
        int[] ans = new int[2];
        int num1=0,num2=0;
        int xor=0;
        for(int i=0;i<nums.length;i++)
        {
            xor^=nums[i];
        }
        int bit=xor & ~(xor-1);
        for(int i=0;i<nums.length;i++)
        {
            if((bit & nums[i])>0)
                num1^=nums[i];
            else
                num2^=nums[i];
        }
        ans[0]=num1;
        ans[1]=num2;

        return ans;
    }
}