[1200. Minimum absolute difference]

source ： Power button （LeetCode）

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⁵
• -10⁶ <= arr[i] <= 10⁶

Method ： Sort + One traverse

Ideas and algorithms

Code :

class Solution {
    
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
    
        int n = arr.size();
        sort(arr.begin(), arr.end());

        int best = INT_MAX;
        vector<vector<int>> ans;
        for (int i = 0; i < n - 1; ++i) {
    
            if (int delta = arr[i + 1] - arr[i]; delta < best) {
    
                best = delta;
                ans = {
    {
    arr[i], arr[i + 1]}};
            }
            else if (delta == best) {
    
                ans.emplace_back(initializer_list<int>{
    arr[i], arr[i + 1]});
            }
        }

        return ans;
    }
};

Execution time ：52 ms, In all C++ Defeated in submission 98.35% Users of
Memory consumption ：31.3 MB, In all C++ Defeated in submission 86.32% Users of
author：LeetCode-Solution