class Solution {
public int singleNumber(int[] nums) {
if(nums.length == 1) return nums[0];
Arrays.sort(nums);
int index = -1;
for(int i=1;i<nums.length;i=i+2){
if(nums[i-1] != nums[i]){
index = i-1;
break;
}
if(i == nums.length-2){
index = i+1;
}
}
// System.out.println(nums[index]);
return nums[index];
}
}
联系客服