C++ Solution ||n100% Beats
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 : O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity : O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int minOperations(vector<int>& nums) {\n        int ans=0;\n       \n        for(int i=1;i<nums.size();i++){\n            if(nums[i]<=nums[i-1]){\n                ans+=nums[i-1]+1-nums[i];\n                nums[i]=nums[i-1]+1;\n            } \n        }\n        return ans;\n    }\n};\n```
['Greedy', 'C++']