Hard
Minimum Number of Increments on Subarrays to Form a Target Array — Python
Full explanation · Time O(n) · Space O(1)
# 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))