Minimum Operations to Make the Array Increasing

You are given a 0-indexed integer array nums. In one operation, you can choose an element of the array and increment it by 1.

Return the minimum number of operations needed to make nums strictly increasing.

An array nums is strictly increasing if nums[i] < nums[i + 1] for all 0 <= i < nums.length - 1. An array of length 1 is trivially strictly increasing.

Example 1
Inputnums = [1,1,1]
Output3
Incrementing elements as needed can transform the array into [1, 2, 3] using 3 total operations, which is minimal.
Example 2
Inputnums = [1,5,2,4,1]
Output14
The minimum number of increments needed to make the array strictly increasing is 14.

Constraints

  • 1 <= nums.length <= 5000
  • 1 <= nums[i] <= 10^4

Asked at 4 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate