python-algorithm
Leetcode 1827. Minimum Operations to Make the Array Increasing
무적김두칠
2021. 7. 21. 13:28
1
2
3
4
5
6
7
8
9
10
|
class Solution:
def minOperations(self, nums: List[int]) -> int:
ans=0
for i in range(1,len(nums)):
tmp=0
if nums[i]<=nums[i-1]:
tmp=nums[i-1]-nums[i]+1
ans+=tmp
nums[i]+=tmp
return ans
|
cs |
반응형