Minimum Operations to Make the Array Increasing Solution in C++
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)$$ -->\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution {\npublic:\n    int minOperations(vector<int>& nums) {\n        int i, count=0;\n        if(nums.size()==1)\n        {\n            return count;\n        }\n        for(i=1 ; i<nums.size() ; i++)\n        {\n            if(nums[i]<=nums[i-1])\n            {\n                count += nums[i-1] - nums[i] + 1;\n                nums[i] += nums[i-1] - nums[i] + 1;\n            }\n        }\n        return count;\n    }\n};\n```
['C++']