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?
用的还是HashSet,提示上是说用位运算会更快一点,具体没有实现过
public class Solution {
public int[] singleNumber(int[] nums) {
Set<Integer> hashSet = new HashSet<Integer>();
for(int i = 0; i<nums.length;i++){
Integer j = new Integer(nums[i]);
if(hashSet.contains(j)){
hashSet.remove(j);
}
else{
hashSet.add(j);
}
}
int[] arry = new int[hashSet.size()];
int i = 0;
java.util.Iterator<Integer> it = hashSet.iterator();
while(it.hasNext()){
arry[i++] = it.next();
}
return arry;
}
}