package LeetCode;

public class LeetCode260 {


    //  nums 
    //https://leetcode-cn.com/problems/single-number-iii/description/

    public int[] singleNumber(int[] nums) {
        int sum = 0;    //
        for (int i = 0; i < nums.length; i++) {
            sum ^= nums[i];
        }
        int[] res = new int[2];

        sum &= -sum;    //1&
        for (int i = 0; i < nums.length; i++) {
            if ((sum & nums[i]) == 0)
                res[0] ^= nums[i];
            else
                res[1] ^= nums[i];
        }
        return res;
    }

}