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]
.
Note:
- The order of the result is not important. So in the above example,
[5, 3]
is also correct. - Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
思考:觉得这题挺难的,而且不知道该怎么做,但是方向还是位操作。
public class Solution {
public int[] singleNumber(int[] nums) {
int ret = 0;
for(int num : nums){
ret ^= num;
}
int lastbit = ret & (-ret);
int[] rets = {0, 0};
for(int num : nums){
if((lastbit & num) == 0){
rets[0] ^= num;
}else{
rets[1] ^= num;
}
}
return rets;
}
}