Problem: 1827. 最少操作使数组递增耗时100%Codeclass Solution { public: int minOperations(vectorint 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; } }; leetcode 耗时100 1827. Minimum Operations to Make the Array Increasing
Problem: 1827. 最少操作使数组递增耗时100%Codeclass Solution { public: int minOperations(vectorint 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; } };