题解 | #数组中只出现一次的两个数字#

public static int[] FindNumsAppearOnce (int[] array) {
Map<Integer,Integer> map = new HashMap<>();
for (int i = 0; i < array.length; i++) {
if (map.get(array[i])!=null){
map.remove(array[i]);
}else {
map.put(array[i],array[i]);
}
}
List<integer> list = new LinkedList<>();
int [] once = new int[2];
if (map.size()!=2){
return once;
}
Set<integer> setTemp = map.keySet();
list.addAll(setTemp);
if (list.get(0)<list.get(1)){
once[0] = list.get(0);
once[1] = list.get(1);
}else {
once[0] = list.get(1);
once[1] = list.get(0);
}
return once;
}</integer></integer>