Single Number III

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

For example:

Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].

 

public class Solution {
    public int[] singleNumber(int[] nums) {
        int a = 0;
        int b = 0;
        for (int i : nums) {
			a ^= i;
		}
        int rightOne = a & (~a + 1);
        for (int i : nums) {
			if ((rightOne & i) != 0) {
				b ^= i;
			}
		}
        return new int[]{b, a^b}; 
    }
}

 

评论

2 楼 hcx2013 2015-11-02  

mircle 写道

Given nums = [1, 2, 1, 3, 2, 5，3], return [5, 0]

Given nums = [1, 2, 1, 3, 2, 5，3，5], return [0, 0]

我没做输入数组的校验，你这个输入序列有问题，谢谢提醒

1 楼 mircle 2015-11-02  

Given nums = [1, 2, 1, 3, 2, 5，3], return [5, 0]

Given nums = [1, 2, 1, 3, 2, 5，3，5], return [0, 0]