Force deduction solution summary 1200 minimum absolute difference

  Directory links ：

Force buckle programming problem - The solution sums up _ Share + Record -CSDN Blog

GitHub Synchronous question brushing items ：

https://github.com/September26/java-algorithms

Original link ： Power button

describe ：

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^5
-10^6 <= arr[i] <= 10^6

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 .

Their thinking ：

*  Their thinking ：
*  This question is relatively simple , After the sorting , The minimum value must be the worst difference between the adjacent two .

Code ：

public class Solution1200 {

    public List<List<Integer>> minimumAbsDifference(int[] arr) {
        Arrays.sort(arr);
        List<List<Integer>> result = new ArrayList<>();
        int minDIff = Integer.MAX_VALUE;
        for (int i = 1; i < arr.length; i++) {
            int diffValue = arr[i] - arr[i - 1];
            if (diffValue < minDIff) {
                result.clear();
                result.add(createList(arr[i], arr[i - 1]));
                minDIff = diffValue;
                continue;
            }
            if (diffValue == minDIff) {
                result.add(createList(arr[i], arr[i - 1]));
                continue;
            }
        }
        return result;
    }

    private List<Integer> createList(int i1, int i2) {
        ArrayList<Integer> integers = new ArrayList<>();
        integers.add(i2);
        integers.add(i1);
        return integers;
    }

}