[Java/Python 3] Straight Forward codes.
Use a dummy value of 0 to initialize the prev; \n2. Traverse the input array, compare each element cur with the modified previous element prev; If cur > prev, u
1. Use a dummy value of `0` to initialize the `prev`; \n2. Traverse the input array, compare each element `cur` with the **modified** previous element `prev`; If `cur > prev`, update `prev` to the value of `cur` for the prospective comparison in the next iteration; otherwise, we need to increase `cur` to at least `prev + 1` to make the array strictly increasing; in this case, update `prev` by increment of `1`.\n```java\n    public int minOperations(int[] nums) {\n        int cnt = 0, prev = 0;\n        for (int cur : nums) {\n            if (cur <= prev) {\n                cnt += ++prev - cur;\n            }else {\n                prev = cur;\n            }\n        }\n        return cnt;\n    }\n```\n```python\n    def minOperations(self, nums: List[int]) -> int:\n        cnt = prev = 0\n        for cur in nums:\n            if cur <= prev:\n                prev += 1\n                cnt += prev - cur\n            else:\n                prev = cur\n        return cnt\n```\n**Analysis:**\n\nTime: `O(n)`, space: `O(1)`, where `n = nums.length`.
[]