Minimum Increment to Make Array Unique LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minIncrementForUnique(vector<int> &nums) {
4
    int minElePossible = 0, ans = 0;
5
    sort(nums.begin(), nums.end());
6
    for (int i = 0; i < nums.size(); i++) {
7
      if (nums[i] < minElePossible) {
8
        ans += minElePossible - nums[i];
9
        nums[i] += minElePossible - nums[i];
10
      }
11
      minElePossible = nums[i] + 1;
12
    }
13
    return ans;
14
  }
15
};