class Solution {
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;
for(int i=0;i<nums.length;i++){
if((sum&nums[i])==0)
res[0] ^= nums[i];
else
res[1]^=nums[i];
}
return res;
}
}