class Solution {
public int singleNumber(int[] nums) {
Arrays.sort(nums);
for (int i = 1;i<nums.length;i++){
if (nums[i] != nums[i+1] || nums[i] != nums[i-1]){
if (nums[i] != nums[i+1] && nums[i-1] != nums[i+1]){
return nums[i+1];
}
if (nums[i] != nums[i-1] && nums[i-1] != nums[i+1]){
return nums[i-1];
}
}else{
i = i+2;
}
}
return nums[nums.length-1];
}
}
剑指 Offer II 004. 只出现一次的数字(Java)
最新推荐文章于 2024-07-24 20:44:05 发布