Maximum Gap LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maximumGap(vector<int> &nums) {
4
    sort(nums.begin(), nums.end());
5
    int res;
6
    int maxx = INT_MIN;
7
    map<int, int> m;
8
    if (nums.size() == 1) return 0;
9
    for (int i = 0; i < nums.size() - 1; i++) {
10
      m[i] = nums[i + 1] - nums[i];
11
    }
12
    for (auto it : m) {
13
      if (it.second > maxx) {
14
        maxx = it.second;
15
      }
16
    }
17
    return maxx;
18
  }
19
};