Best Java Solution || Beats 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[] arr) {\n        int n = arr.length;\n        \n        int ans = 0;\n\n        for(int i=1; i<n; i++){\n            if(arr[i]<=arr[i-1]){\n                ans = ans + arr[i-1]-arr[i]+1;\n                arr[i] = arr[i-1]+1;\n            }\n        }\n        return ans;\n    }\n}\n```
['Java']