算法练习(38) leetcode 137. 只出现一次的数字 II(排序找规律法)

https://leetcode-cn.com/problems/single-number-ii/

class Solution {
    public int singleNumber(int[] nums) {
        if(nums.length==1){
            return nums[0];
        }
        Arrays.sort(nums);
        if (nums[0]!=nums[1]){
            return nums[0];
        }
        if (nums[nums.length-1]!=nums[nums.length-2]){
            return nums[nums.length-1];
        }
        for (int i=1;i<nums.length-1;i++){
            if (nums[i]!=nums[i-1]&&nums[i]!=nums[i+1]){
                return nums[i];
            }
        }
            return -1;
    }
}