LC-1526 Hard LeetCode

1526. Minimum Number of Increments on Subarrays to Form a Target Array

Array Dynamic Programming Stack Greedy Monotonic Stack

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 72% Topics: Array, Dynamic Programming, Stack, Greedy, Monotonic Stack

Reading material

Arrays & Hashing 12 min 1-D Dynamic Programming 16 min Stacks & Queues 11 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def minNumberOperations(self, target):
        """
        :type target: List[int]
        :rtype: int
        """
        return sum(max((target[i] if i < len(target) else 0)-(target[i-1] if i-1 >= 0 else 0), 0) for i in xrange(len(target)+1))

Solution from kamyu104/LeetCode-Solutions · MIT