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


	For example, if nums = [1,2,3], you can choose to increment nums[1] to make nums = [1,3,3].


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

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

&nbsp;
Example 1:

Input: nums = [1,1,1]
Output: 3
Explanation: You can do the following operations:
1) Increment nums[2], so nums becomes [1,1,2].
2) Increment nums[1], so nums becomes [1,2,2].
3) Increment nums[2], so nums becomes [1,2,3].


Example 2:

Input: nums = [1,5,2,4,1]
Output: 14


Example 3:

Input: nums = [8]
Output: 0


&nbsp;
Constraints:


	1 &lt;= nums.length &lt;= 5000
	1 &lt;= nums[i] &lt;= 104

class Solution:
    def minOperations(self, nums: List[int]) -> int:
        sol = 0
        last = nums[0]

        for i in range(len(nums) - 1):
            if last >= nums[i + 1]:
                sol += last - nums[i + 1] + 1
                last = last + 1
            else:
                last = nums[i + 1]
        
        return sol
class Solution {
    public int minOperations(int[] nums) {
        if (nums.length <= 1) {
            return 0;
        }

        int count = 0;
        int num = nums[0];
        for (int i = 1; i < nums.length; i++) {
            if (num == nums[i]) {
                count++;
                num++;
            } else if (num > nums[i]) {
                num++;
                count += num - nums[i];
            } else {
                num = nums[i];
            }
        }
        
        return count;
    }
}
class Solution {
public:
    int minOperations(vector<int>& nums) {
        int output=0;
        for(int i=0;i<nums.size()-1;i++){
            if(nums[i]<nums[i+1])
                continue;
            else{
                output=output+(nums[i]+1-nums[i+1]);
                nums[i+1]=nums[i]+1;
            }
        }
        return output;
    }
};
var minOperations = function(nums) {
    if(nums.length < 2) return 0;
    let count = 0;
    for(let i = 1; i<nums.length; i++) {
       if(nums[i] <= nums[i-1]) {
           let change = nums[i-1] - nums[i] + 1;
           count += change;
           nums[i] += change;
       }
    }
    
    return count;
};
Minimum Operations to Make the Array Increasing