Minimum Operations to Make the Array Increasing LeetCode solution in Java

1
class Solution {
2
  public int minOperations(int[] nums) {
3
    if (nums.length <= 1) {
4
      return 0;
5
    }
6

7
    int count = 0;
8
    int num = nums[0];
9
    for (int i = 1; i < nums.length; i++) {
10
      if (num == nums[i]) {
11
        count++;
12
        num++;
13
      } else if (num > nums[i]) {
14
        num++;
15
        count += num - nums[i];
16
      } else {
17
        num = nums[i];
18
      }
19
    }
20

21
    return count;
22
  }
23
}