Minimum Operations to Make the Array Increasing LeetCode solution in Python

1
class Solution:
2
def minOperations(self, nums: List[int]) -> int:
3
sol = 0
4
last = nums[0]
5

6
for i in range(len(nums) - 1):
7
if last >= nums[i + 1]:
8
sol += last - nums[i + 1] + 1
9
last = last + 1
10
else:
11
last = nums[i + 1]
12

13
return sol

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0