Leetcode-5197 Minimum Absolute Difference(最小绝对差)

#define _for(i,a,b) for(int i = (a);i < b;i ++)
#define _rep(i,a,b) for(int i = (a);i > b;i --)
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define pb push_back
#define maxn 10003

class Solution
{
    public:
        vector<vector<int>> minimumAbsDifference(vector<int>& arr)
        {
            vector<vector<int>> ans;
            sort(arr.begin(),arr.end());
            int diff = INF;
            _for(i,0,arr.size()-1)
                diff = min(diff,arr[i+1]-arr[i]);
            
            vector<int> tmp;
            _for(i,0,arr.size()-1)
            {
                tmp.clear();
                if(arr[i+1]-arr[i]==diff)
                {
                    tmp.pb(arr[i]);
                    tmp.pb(arr[i+1]);
                    ans.pb(tmp);
                }
            }
            return ans;
        }
};