Time: 86 ms (20.54%), Space: 26.7 MB (36.79%) - LeetHub

Author: hogan-tech

1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array.py

@@ -0,0 +1,19 @@
+# time complexity: O(n)
+# space complexity: O(1)
+from typing import List
+
+
+class Solution:
+    def minNumberOperations(self, target: List[int]) -> int:
+        result = target[0]
+        for i in range(1, len(target)):
+            result += max(target[i] - target[i - 1], 0)
+        return result
+
+
+target = [1, 2, 3, 2, 1]
+print(Solution().minNumberOperations(target))
+target = [3, 1, 1, 2]
+print(Solution().minNumberOperations(target))
+target = [3, 1, 5, 4, 2]
+print(Solution().minNumberOperations(target))