260
自己思路
HashMap,还有位运算的题解
class Solution {
public int[] singleNumber(int[] nums) {
Map<Integer, Integer> count= new HashMap<Integer, Integer>();
for (int num : nums) {
count.put(num, count.getOrDefault(num, 0) + 1);
}
int[] ans = new int[2];
int index = 0;
for (Map.Entry<Integer, Integer> entry : count.entrySet()) {
if (entry.getValue() == 1) {
ans[index++] = entry.getKey();
}
}
return ans;
}
}