1846. Maximum Element After Decreasing and Rearranging

Обновлено: 2024-03-12
1 мин
[]

Содержание

LeetCode problem 1846

class Solution:
    def maximumElementAfterDecrementingAndRearranging(self, arr: List[int]) -> int:
        arr.sort()
        arr[0] = 1
        for i in range(1, len(arr)):
            d = max(0, arr[i] - arr[i - 1] - 1)
            arr[i] -= d
        return max(arr)