先对数组排序,遍历查找
public class Solution {
public int singleNumber(int[] nums) {
int N = nums.length;
int temp;
for(int i = 1; i < N; i++){
for(int j = i; j > 0 && nums[j] < nums[j-1]; j-- ){
temp = nums[j];
nums[j] = nums[j-1];
nums[j-1] = temp;
}
}
for(int i = 0; i < N-1; i += 2){
if(nums[i] != nums[i+1]) return nums[i];
}
return nums[N-1];
}
}