Problem: 1827. 最少操作使数组递增
耗时100%
Code
class Solution { public: int minOperations(vector<int>& nums) { int n = nums.size(); if(n == 1) return 0; int sum = 0, last = nums[0]; for(int i = 1; i < n; i++) { if(nums[i] <= last) { sum += last + 1 - nums[i]; last++; nums[i] = last; } else { last = nums[i]; } } return sum; } };