1827. Minimum Operations to Make the Array Increasing Easy

1/**
2 * [1827] Minimum Operations to Make the Array Increasing
3 *
4 * 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.
5 * 
6 * 
7 * 	For example, if nums = [1,2,3], you can choose to increment nums[1] to make nums = [1,<u>3</u>,3].
8 * 
9 * 
10 * Return the minimum number of operations needed to make nums strictly increasing.
11 * 
12 * An array nums is strictly increasing if nums[i] < nums[i+1] for all 0 <= i < nums.length - 1. An array of length 1 is trivially strictly increasing.
13 * 
14 *  
15 * Example 1:
16 * 
17 * 
18 * Input: nums = [1,1,1]
19 * Output: 3
20 * Explanation: You can do the following operations:
21 * 1) Increment nums[2], so nums becomes [1,1,<u>2</u>].
22 * 2) Increment nums[1], so nums becomes [1,<u>2</u>,2].
23 * 3) Increment nums[2], so nums becomes [1,2,<u>3</u>].
24 * 
25 * 
26 * Example 2:
27 * 
28 * 
29 * Input: nums = [1,5,2,4,1]
30 * Output: 14
31 * 
32 * 
33 * Example 3:
34 * 
35 * 
36 * Input: nums = [8]
37 * Output: 0
38 * 
39 * 
40 *  
41 * Constraints:
42 * 
43 * 
44 * 	1 <= nums.length <= 5000
45 * 	1 <= nums[i] <= 10^4
46 * 
47 */
48pub struct Solution {}
49
50// problem: https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/
51// discuss: https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/discuss/?currentPage=1&orderBy=most_votes&query=
52
53// submission codes start here
54
55impl Solution {
56    pub fn min_operations(nums: Vec<i32>) -> i32 {
57        0
58    }
59}
60
61// submission codes end
62
63#[cfg(test)]
64mod tests {
65    use super::*;
66
67    #[test]
68    fn test_1827() {
69    }
70}
71