Skip to content
LC-1827 Easy LeetCode

1827. Minimum Operations to Make the Array Increasing

Read the full problem statement on LeetCode.
Difficulty: easy Acceptance: 81% Topics: Array, Greedy
View full problem on LeetCode
Reference solution (spoiler · python)
# Time:  O(n)
# Space: O(1)

class Solution(object):
    def minOperations(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result = prev = 0
        for curr in nums:
            if prev < curr:
                prev = curr
                continue
            prev += 1
            result += prev-curr                
        return result

Solution from kamyu104/LeetCode-Solutions · MIT