Minimum Absolute Difference leetCode

 Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements.

Return a list of pairs in ascending order(with respect to pairs), each pair [a, b] follows

a, b are from arr

a < b

b - a equals to the minimum absolute difference of any two elements in arr

 

Example 1:

Input: arr = [4,2,1,3]

Output: [[1,2],[2,3],[3,4]]

Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.

Example 2:

Input: arr = [1,3,6,10,15]

Output: [[1,3]]

Example 3:

Input: arr = [3,8,-10,23,19,-4,-14,27]

Output: [[-14,-10],[19,23],[23,27]]

import java.util.*;

class Solution {

    public List<List<Integer>> minimumAbsDifference(int[] arr) {

        List<List<Integer>> bigList = new ArrayList<>();

        // Step 1: Sort the array

        Arrays.sort(arr);

        // Step 2: Initialize the minimum difference to a large value

        int minDiff = Integer.MAX_VALUE;

        // Step 3: Find the minimum difference between adjacent elements in the sorted array

        for (int i = 1; i < arr.length; i++) {

            minDiff = Math.min(minDiff, arr[i] - arr[i - 1]);

        }

        // Step 4: Find all pairs with the minimum difference

        for (int i = 1; i < arr.length; i++) {

            if (arr[i] - arr[i - 1] == minDiff) {

                bigList.add(Arrays.asList(arr[i - 1], arr[i]));

            }

        }

        // Step 5: Return the list of pairs with the minimum difference

        return bigList;

    }

}