Maximum Element After Decreasing and Rearranging LeetCode solution in C++

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