Find All Lonely Numbers in the Array LeetCode solution in Java

1
class Solution {
2
  public List<Integer> findLonely(int[] nums) {
3
    Arrays.sort(nums);
4
    ArrayList<Integer> list = new ArrayList<>();
5
    for (int i = 1; i < nums.length - 1; i++) {
6
      if (nums[i - 1] + 1 < nums[i] && nums[i] + 1 < nums[i + 1]) {
7
        list.add(nums[i]);
8
      }
9
    }
10
    if (nums.length == 1) {
11
      list.add(nums[0]);
12
    }
13
    if (nums.length > 1) {
14
      if (nums[0] + 1 < nums[1]) {
15
        list.add(nums[0]);
16
      }
17
      if (nums[nums.length - 2] + 1 < nums[nums.length - 1]) {
18
        list.add(nums[nums.length - 1]);
19
      }
20
    }
21
    return list;
22
  }
23
}