leetcode 1200. 最小绝对差

1200. 最小绝对差

class Solution {
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
        vector<int> v(arr);
        sort(v.begin(), v.end());
        int mingap = 0x3f3f3f3f;
        for (int i = 0; i < v.size() - 1; i ++)
            mingap = min(mingap, v[i + 1] - v[i]);
        // cout << mingap << endl;
        // for (auto x : v) cout << x << " ";
        vector<vector<int>> ret;
        for (int i = 0; i < v.size() - 1; i ++)
        {
            vector<int> temp;
            if (v[i + 1] - v[i] == mingap)
            {
                temp.push_back(v[i]);
                temp.push_back(v[i + 1]);
            }
            if (!temp.empty())
                ret.push_back(temp);
        }
        return ret;
    }
};