Focus on Efficiency (2024 NG)
Google● EasyFULLTIMEOAProblem statement
Given an array of integers A, with each move you can select an arbitrary range and increment all the numbers in that range by 1. Return the number of moves needed to transform an array starting with all zeros into A.
Function
minMoves(A: int[]) → intExamples
Example 1
A = [2, 1, 3]return = 4
To transform [0, 0, 0] into [2, 1, 3] requires 4 moves, as follows:
[0, 0, 0] -> [1, 1, 1] -> [2, 1, 1] -> [2, 1, 2] -> [2, 1, 3]
Constraints
1 <= A.length <= 10^50 <= A[i] <= 10^4