leetCode1200

先排序

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

 

来源：https://blog.csdn.net/qq_36257146/article/details/102779400