题目链接:https://leetcode-cn.com/problems/single-number/
题目如下:
class Solution {
public int singleNumber(int[] nums) {
HashSet<Integer> hash=new HashSet<Integer>();
int number=0;
for(int i=0;i<nums.length;i++){
if(hash.add(nums[i])==false) hash.remove(nums[i]);
}
for(int i=0;i<nums.length;i++){
if(hash.contains(nums[i])){
number=nums[i];
}
}
return number;
}
}