剑指offer基础版 --- 第22天

class Solution {
    
    public int[] singleNumbers(int[] nums) {
    
        int ret = 0;
        for(int num : nums){
    
            ret = ret ^ num;
        }
        int target = 1;
        while((target & ret) == 0){
    
            target = target << 1;
        }
        int a = 0;
        int b = 0;
        for(int num : nums){
    
            if((num & target) == 0){
    
                a = a ^ num;
            }else{
    
                b = b ^ num;
            }
        }

        return new int[]{
    a,b};

    }
}

class Solution {
    
    public int singleNumber(int[] nums) {
    
        int[] counts = new int[32];
        for(int num : nums) {
    
            for(int j = 0; j < 32; j++) {
    
                counts[j] += num & 1;
                num >>>= 1;
            }
        }
        int res = 0, m = 3;
        for(int i = 0; i < 32; i++) {
    
            res = (counts[i] % m) << i |  res;
        }
        return res;
    }
}