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

Given a target array and allowed to increment any contiguous subarray by 1, find the minimum operations to build it — a greedy/scan problem where the optimal cost equals target[0] plus the sum of all positive increases target[i]-target[i-1], computable in O(n) time.