1200. Minimum Absolute Difference

Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. 

Return a list of pairs in ascending order(with respect to pairs), each pair [a, b] follows

a, b are from arr
a < b
b - a equals to the minimum absolute difference of any two elements in arr
 

Example 1:

Input: arr = [4,2,1,3]
Output: [[1,2],[2,3],[3,4]]
Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.
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]]
 

Constraints:

2 <= arr.length <= 10^5
-10^6 <= arr[i] <= 10^6

这题很简单，排序后找出最小的差值，然后再次遍历即可。

class MinimumAbsoluteDifference : public Solution {
public:
    void Exec() {

    }

    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
        std::sort(arr.begin(), arr.end());
        int min_diff = INT_MAX;

        for (int i = 1; i < arr.size(); i++) {
            if (arr[i] - arr[i - 1] < min_diff) {
                min_diff = arr[i] - arr[i - 1];
            }
        }

        vector<vector<int>> res;
        for (int i = 1; i < arr.size(); i++) {
            if (arr[i] - arr[i - 1] == min_diff) {
                res.push_back(vector<int>{arr[i - 1], arr[i]});
            }
        }

        return res;
    }
};