题目链接:
力扣https://leetcode-cn.com/problems/minimum-operations-to-make-the-array-increasing/
【分析】一次遍历,如果后面比前面小,ans+=(nums[i - 1] - nums[i] + 1),并修改nums[i]的值为nums[i - 1] + 1。
class Solution {
public int minOperations(int[] nums) {
int ans = 0;
int n = nums.length;
int i, j;
for(i = 1; i < n; i++){
if(nums[i] <= nums[i - 1]) {
ans += nums[i - 1] - nums[i] + 1;
nums[i] = nums[i - 1] + 1;
}
}
return ans;
}
}