Force buckle 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

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

Input ：arr = [1,3,6,10,15]
Output ：[[1,3]]

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

source ： Power button （LeetCode）
link ：https://leetcode.cn/problems/minimum-absolute-difference
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

Method 1： simulation

Java Realization

class Solution {
    
    public List<List<Integer>> minimumAbsDifference(int[] arr) {
    
        int n = arr.length;
        Arrays.sort(arr);
        List<List<Integer>> res = new ArrayList<>();

        int min = Integer.MAX_VALUE;
        for (int i = 0; i < n - 1; i++) {
    
            int cur = Math.abs(arr[i] - arr[i + 1]);
            if (cur == min) {
    
                res.add(Arrays.asList(arr[i], arr[i + 1]));
            } else if (cur < min) {
    
                min = cur;
                res = new ArrayList<>();
                res.add(Arrays.asList(arr[i], arr[i + 1]));
            }
        }
        return res;
    }
}