Minimum Absolute Difference LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<vector<int>> minimumAbsDifference(vector<int> &arr) {
4
    sort(arr.begin(), arr.end());
5
    int diff = INT_MAX;
6
    for (int i = 1; i < arr.size(); i++) {
7
      diff = min(diff, abs(arr[i] - arr[i - 1]));
8
    }
9
    vector<vector<int>> v;
10
    for (int i = 1; i < arr.size(); i++) {
11
      if (abs(arr[i] - arr[i - 1]) == diff) {
12
        int a = min(arr[i], arr[i - 1]);
13
        int b = max(arr[i], arr[i - 1]);
14
        v.push_back({a, b});
15
      }
16
    }
17
    return v;
18
  }
19
};