Given a non-empty array of integers
nums
, every element appears twice except for one. Find that single one.You must implement a solution with a linear runtime complexity and use only constant extra space.
给定一个非空整数数组,除了某个元素只出现一次以外,其余每个元素均出现两次。找出那个只出现了一次的元素。
说明:
你的算法应该具有线性时间复杂度。 你可以不使用额外空间来实现吗?
Example 1:
Input: nums = [2,2,1] Output: 1Example 2:
Input: nums = [4,1,2,1,2] Output: 4Example 3:
Input: nums = [1] Output: 1Constraints:
1 <= nums.length <= 3 * 104
-3 * 104 <= nums[i] <= 3 * 104
- Each element in the array appears twice except for one element which appears only once.
class Solution {
public int singleNumber(int[] nums) {
Arrays.sort(nums);
for(int i = 0;i < nums.length;i++){
if(i == nums.length - 1){
return nums[i];
}
if(nums[i] == nums[i + 1]){
i++;
} else { //注意不能再写if不等于。如果这样的话当数组为奇数时会不好处理
return nums[i];
}
}
return -1;
}
}