Minimum Absolute Difference LeetCode solution in Java

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