剑指 Offer 56 - I. 数组中数字出现的次数
class Solution {
public int[] singleNumbers(int[] nums) {
int x = 0, y = 0, n = 0, m = 1;
for(int num : nums){
n = n^num;
}
while( (n & m) == 0) m = m<<1;
for(int num: nums){
if( (num & m) ==0) x = x^num;
else y = y^num;
}
return new int[]{x,y};
}
}
