Daily question -leetcode1200- minimum absolute difference - array - sort

Original link

Note：

Because there are no duplicate elements , So sort the array first , Then judge the absolute value of their difference in groups of two , If something smaller appears , Just empty the answer array , Put into the current combination , Then update the minimum value

Or equal to the minimum , Then throw it directly into the answer array , Otherwise, the two pointers will move back

The code is as follows ：

class Solution {
    
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
    
        vector<vector<int>> ans;
        int minNum = INT_MAX;
        sort(arr.begin(), arr.end());
        for(int i = 0, j = 1; j < arr.size(); i ++, j ++){
    
            if(abs(arr[i] - arr[j]) < minNum){
    
                ans.clear();
                ans.push_back({
    min(arr[i], arr[j]), max(arr[i], arr[j])});
                minNum = abs(arr[i] - arr[j]);
            }else if(abs(arr[i] - arr[j]) == minNum)
                ans.push_back({
    min(arr[i], arr[j]), max(arr[i], arr[j])});
        }

        return ans;
    }
};