Class Solution
java.lang.Object
g1801_1900.s1827_minimum_operations_to_make_the_array_increasing.Solution
1827 - Minimum Operations to Make the Array Increasing.<p>Easy</p>
<p>You are given an integer array <code>nums</code> ( <strong>0-indexed</strong> ). In one operation, you can choose an element of the array and increment it by <code>1</code>.</p>
<ul>
<li>For example, if <code>nums = [1,2,3]</code>, you can choose to increment <code>nums[1]</code> to make <code>nums = [1, **3** ,3]</code>.</li>
</ul>
<p>Return <em>the <strong>minimum</strong> number of operations needed to make</em> <code>nums</code> <em><strong>strictly</strong> <strong>increasing</strong>.</em></p>
<p>An array <code>nums</code> is <strong>strictly increasing</strong> if <code>nums[i] < nums[i+1]</code> for all <code>0 <= i < nums.length - 1</code>. An array of length <code>1</code> is trivially strictly increasing.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [1,1,1]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong> You can do the following operations:</p>
<ol>
<li>
<p>Increment nums[2], so nums becomes [1,1, <strong>2</strong> ].</p>
</li>
<li>
<p>Increment nums[1], so nums becomes [1, <strong>2</strong> ,2].</p>
</li>
<li>
<p>Increment nums[2], so nums becomes [1,2, <strong>3</strong> ].</p>
</li>
</ol>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [1,5,2,4,1]</p>
<p><strong>Output:</strong> 14</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> nums = [8]</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums.length <= 5000</code></li>
<li><code>1 <= nums[i] <= 10<sup>4</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
minOperations
public int minOperations(int[] nums)
-