题目描述:
思路:
代码实现:
class Solution {
public int maximumElementAfterDecrementingAndRearranging(int[] arr) {
Arrays.sort(arr);
arr[0] = 1;
int len = arr.length;
for (int i = 1; i < len; i++) {
if (arr[i] == arr[i - 1] || arr[i] == arr[i - 1] + 1) {
continue;
} else {
arr[i] = arr[i - 1] + 1;
}
}
return arr[len - 1];
}
}