问题:
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?
解决:
① 使用map记录出现的次数。
class Solution { //16ms
public int[] singleNumber(int[] nums) {
Map<Integer,Integer> map = new HashMap<>();
for (int n : nums){
map.put(n,map.getOrDefault(n,0) + 1);
}
List<Integer> list = new ArrayList<>();
for (Map.Entry<Integer,Integer> entry : map.entrySet()){
if (entry.getValue() == 1){
list.add(entry.getKey());
}
}
int[] res = new int[list.size()];
for (int i = 0;i < list.size();i ++){
res[i] = list.get(i);
}
return res;
}
}
② 位操作。
class Solution { //2ms
public int[] singleNumber(int[] nums) {
int xor = 0;
for (int n : nums){ //排除出现两次的数字,得到只出现两次的数字的异或结果,A xor B = B xor A
xor ^= n;
}
int i = Integer.highestOneBit(xor);//因为A 和 B 是不相同的,所以他们的二进制数字有且至少有一位是不相同的。获取第一位不同的数
int[] res = new int[2];
for (int n : nums){
if ((n & i) == 0){//数字 A 和 数字 B 中必然有一个数字与上 bitFlag 为 0,该位为 0 的数字与上 bitFlag 就等于 0,而该位为 1 的数字与上 bitFlag 就等于 bitFlag
res[0] = res[0] ^ n;
}else{
res[1] = res[1] ^ n;
}
}
return res;
}
}