Leetcode 1200 minimum absolute difference [sort] the way of leetcode in heroding

Their thinking ：
Sort first , Because the smallest absolute value difference must be between adjacent numbers , So compare two iterations , Set up a diff The difference is taken as the minimum difference , Update when encountering smaller ones , And empty ans, The code is as follows ：

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