Easy 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int minOperations(int[] nums) {\n        int count =0;\n        for(int i=1; i<nums.length; i++){\n            if(nums[i] <= nums[i-1]){\n            int dif = nums[i-1] - nums[i]+1;\n                nums[i]+=dif;\n                count+=dif;\n             }\n            \n        }\n        return count;\n    }\n}\n```
['Java']