[leetCode刷题笔记]260. Single Number III

public class Solution {
    public int[] singleNumber(int[] nums) {
        int xor = 0;
        
        for (int num : nums) {
            xor ^= num;
        }
        
        xor &= -xor;
        
        int[] rets = {0, 0};
        
        for (int num : nums) {
            if ((num & xor) == 0) {
                rets[0] ^= num;
            }
            else {
                rets[1] ^= num;
            }
        }
        return rets;
    }
}