[daily training] 1200 Minimum absolute difference

subject

Here's an array of integers arr, Each of these elements is inequality .

Please find all the elements with the least absolute difference , And return in ascending order .

Example 1：
Input ：arr = [4,2,1,3]
Output ：[[1,2],[2,3],[3,4]]

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]]

Tips ：
2 <= arr.length <= 10⁵
-10⁶ <= arr[i] <= 10⁶

Code

package dayLeetCode;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class dayleetcode1200 {
    
    public List<List<Integer>> minimumAbsDifference(int[] arr) {
    
        Arrays.sort(arr);

        List<List<Integer>> ansList = new ArrayList<>();
        int maxCnt = Integer.MAX_VALUE;
        for (int i = 0; i < arr.length - 1; i++){
    
            int tmp = arr[i + 1] - arr[i];
            maxCnt = Math.min(tmp, maxCnt);
        }

        for (int i = 0; i < arr.length - 1; i++){
    
            int tmp = arr[i + 1] - arr[i];
            if (tmp == maxCnt){
    
                List<Integer> tmpList = new ArrayList<>();
                tmpList.add(arr[i]);
                tmpList.add(arr[i + 1]);
                ansList.add(tmpList);
            }
        }
        return ansList;
    }

    public static void main(String[] args) {
    
        dayleetcode1200 obj = new dayleetcode1200();
        System.out.println(obj.minimumAbsDifference(new int[]{
    4, 2, 1, 3}));
    }

}