Leetcode 1200. 最小绝对差

Leetcode 1200. 最小绝对差

class Solution {
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
        sort(arr.begin(),arr.end());
        int flg = 0;
        vector<vector<int>> vv;
        for(int i=0;i<arr.size()-1;i++)
        {
            vector<int> v;
            v.push_back(arr[i]);
            v.push_back(arr[i+1]);

            int len = arr[i+1] - arr[i];
            if(vv.size() == 0)
            {
                vv.push_back(v);
                flg = len;
            }
            else
            {
                if(len < flg)
                {
                    vv.clear();
                    vv.push_back(v);
                    flg = len;
                }
                else if(len == flg)
                {
                    vv.push_back(v);
                }
            }
        }
        return vv;
    }
};