Coding/single_num.java at main · shr100/Coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
//Link: https://leetcode.com/problems/single-number/
class Solution {
    public int singleNumber(int[] nums) {
        Arrays.sort(nums);

        if(nums.length==1){
            return nums[0];
        }
        else{
        for(int i=0;i<nums.length;i++){
            if(i==0){
                if(nums[i]!=nums[i+1]){

                    return nums[i];
                }
            }
            else if(i==nums.length-1){
                return nums[i];
            }
            else{
                if((nums[i-1]!=nums[i])&&(nums[i+1]!=nums[i])){
                    return nums[i];
                }
            }
            }
        }
        return 0;
    }

}