LeetCode 1200. 最小绝对差

示例 1：
输入：arr = [4,2,1,3]
输出：[[1,2],[2,3],[3,4]]

示例 2：
输入：arr = [1,3,6,10,15]
输出：[[1,3]]

示例 3：
输入：arr = [3,8,-10,23,19,-4,-14,27]
输出：[[-14,-10],[19,23],[23,27]]
 
提示：
2 <= arr.length <= 10^5
-10^6 <= arr[i] <= 10^6

class Solution {
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
        if(arr.size() <= 1)
            return {};
        sort(arr.begin(),arr.end());
        int differ = INT_MAX;
        for(int i = 1; i < arr.size(); ++i)
        {
            if(differ > arr[i]-arr[i-1])
                differ = arr[i]-arr[i-1];
        }
        vector<vector<int>> ans;
        for(int i = 1; i < arr.size(); ++i)
        {
            if(differ == arr[i]-arr[i-1])
               ans.push_back({arr[i-1],arr[i]}) ;
        }
        return ans;
    }
};