Beginner-friendly || Simple solution in Python3/TypeScript
Intuition\nThe problem description is the following:\n- there\'s a list of nums\n- our goal is to make nums strongly increasing\n\nThere\'s no need in sorting. 
# Intuition\nThe problem description is the following:\n- there\'s a list of `nums`\n- our goal is to make `nums` **strongly increasing**\n\nThere\'s no need in sorting. The approach is straightforward and requires to calculate difference between adjacent integers.\n\n# Approach\n1. initialize `ans` to store the answer\n2. iterate over `nums`, check if `nums[i] <= nums[i - 1]`, then calculate `diff` and increment `ans`\n3. return `ans`\n\n# Complexity\n- Time complexity: **O(n)**, to iterate over `nums`\n\n- Space complexity: **O(1)**, we don\'t allocate extra space.\n\n# Code in TypeScript\n```\nfunction minOperations(nums: number[]): number {\n    let ans = 0\n\n    for (let i = 1; i < nums.length; i++) {\n        if (nums[i] <= nums[i - 1]) {\n            const diff = Math.abs(nums[i] - nums[i - 1]) + 1\n            nums[i] += diff \n            ans += diff\n        }\n    }\n\n    return ans\n};\n```\n\n# Code in Python3\n```\nclass Solution:\n    def minOperations(self, nums: List[int]) -> int:\n        ans = 0\n\n        for i in range(1, len(nums)):\n            if nums[i] <= nums[i - 1]:\n                diff = abs(nums[i] - nums[i - 1]) + 1\n                nums[i] += diff\n                ans += diff\n\n        return ans\n```
['Array', 'Greedy', 'Python3']