Easy and just count it
ApproachCreate a count variable to track the number of operations.Loop through the array from index 0 to n - 2 (we compare each element with the next).For each
# Approach
Create a count variable to track the number of operations.

Loop through the array from index 0 to n - 2 (we compare each element with the next).

For each pair nums[i] and nums[i+1]:

If nums[i] >= nums[i+1], it means we need to increase nums[i+1].

Calculate how much to increase it by: diff = nums[i] - nums[i+1] + 1.

We add +1 to make it strictly greater.

Add diff to count.

Update nums[i+1] by adding diff to it.

After the loop ends, return count.

# Code
```java []
class Solution {
    public static int minOperations(int[] nums) {
        
    	int count = 0;
    	
    	for (int i = 0; i < nums.length-1; i++) {
			
    		if(nums[i] >= nums[i+1]) {
    			
                int diff = nums[i] - nums[i + 1] + 1;
    			
    			count += diff;
    			
    			
    			nums[i+1] += diff;
    		}
    		
		}
    	return count;
    }
}
```
['Java']