leetcode 1846. Maximum Element After Decreasing and Rearranging

Problem: 1846. 减小和重新排列数组后的最大元素排序然后从1开始若差值 1end end 1否则end arr[i]Codeclass Solution { public: int maximumElementAfterDecrementingAndRearranging(vectorint arr) { sort(arr.begin(), arr.end()); int n arr.size(), end min(arr[0], 1); for(int i 1; i n; i) { if(arr[i] - end 1) end end 1; else end arr[i]; } return end; } };