1200. Minimum absolute difference

Original link ：1200. Minimum absolute difference

 

solution:

        Sort + Traverse

class Solution {
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
        vector<vector<int>> res;    // Define the return value 
        sort(arr.begin(),arr.end());
        int mindiff = INT_MAX;
        for(int i = 1;i < arr.size();i++) {
            if(arr[i] - arr[i - 1] < mindiff) {
                res.clear();
                res.push_back({arr[i - 1], arr[i]});
                mindiff = arr[i] - arr[i - 1];
            }
            else if(arr[i] - arr[i - 1] == mindiff) {
                res.push_back({arr[i - 1], arr[i]});
            }
        }
        return res;
    }
};