Python3 simple solution beats 90% users
\nclass Solution:\n    def minOperations(self, nums: List[int]) -> int:\n        count = 0\n        for i in range(1,len(nums)):\n            if nums[i] <= nums
```\nclass Solution:\n    def minOperations(self, nums: List[int]) -> int:\n        count = 0\n        for i in range(1,len(nums)):\n            if nums[i] <= nums[i-1]:\n                x = nums[i]\n                nums[i] += (nums[i-1] - nums[i]) + 1\n                count += nums[i] - x\n        return count\n```\n**If you like this solution, please upvote for this**
['Python3']