Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 1846. Maximum Element After Decreasing and Rearranging

---

題目：


解答：

class Solution {
public:
    int maximumElementAfterDecrementingAndRearranging(vector<int>& arr) {
        int n = arr.size();

        sort(arr.begin(), arr.end());
        arr[0] = 1;

        for (int i = 1; i < n; ++i) {
            arr[i] = min(arr[i], arr[i - 1] + 1);
        }

        return arr.back();
    }
};