{"id":8354,"date":"2021-04-17T11:51:33","date_gmt":"2021-04-17T18:51:33","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8354"},"modified":"2021-04-17T11:52:02","modified_gmt":"2021-04-17T18:52:02","slug":"leetcode-1827-minimum-operations-to-make-the-array-increasing","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/algorithms\/array\/leetcode-1827-minimum-operations-to-make-the-array-increasing\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1827. Minimum Operations to Make the Array Increasing"},"content":{"rendered":"\n<p>You are given an integer array&nbsp;<code>nums<\/code>&nbsp;(<strong>0-indexed<\/strong>). In one operation, you can choose an element of the array and increment it by&nbsp;<code>1<\/code>.<\/p>\n\n\n\n<ul class=\"wp-block-list\"><li>For example, if&nbsp;<code>nums = [1,2,3]<\/code>, you can choose to increment&nbsp;<code>nums[1]<\/code>&nbsp;to make&nbsp;<code>nums = [1,<u><strong>3<\/strong><\/u>,3]<\/code>.<\/li><\/ul>\n\n\n\n<p>Return&nbsp;<em>the&nbsp;<strong>minimum<\/strong>&nbsp;number of operations needed to make<\/em>&nbsp;<code>nums<\/code>&nbsp;<em><strong>strictly<\/strong>&nbsp;<strong>increasing<\/strong>.<\/em><\/p>\n\n\n\n<p>An array&nbsp;<code>nums<\/code>&nbsp;is&nbsp;<strong>strictly increasing<\/strong>&nbsp;if&nbsp;<code>nums[i] &lt; nums[i+1]<\/code>&nbsp;for all&nbsp;<code>0 &lt;= i &lt; nums.length - 1<\/code>. An array of length&nbsp;<code>1<\/code>&nbsp;is trivially strictly increasing.<\/p>\n\n\n\n<p><strong>Example 1:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> nums = [1,1,1]\n<strong>Output:<\/strong> 3\n<strong>Explanation:<\/strong> You can do the following operations:\n1) Increment nums[2], so nums becomes [1,1,<strong>2<\/strong>].\n2) Increment nums[1], so nums becomes [1,<strong>2<\/strong>,2].\n3) Increment nums[2], so nums becomes [1,2,<strong>3<\/strong>].\n<\/pre>\n\n\n\n<p><strong>Example 2:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> nums = [1,5,2,4,1]\n<strong>Output:<\/strong> 14\n<\/pre>\n\n\n\n<p><strong>Example 3:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> nums = [8]\n<strong>Output:<\/strong> 0\n<\/pre>\n\n\n\n<p><strong>Constraints:<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\"><li><code>1 &lt;= nums.length &lt;= 5000<\/code><\/li><li><code>1 &lt;= nums[i] &lt;= 10<sup>4<\/sup><\/code><\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Solution: Track Last<\/strong><\/h2>\n\n\n\n<p>Time complexity: O(n)<br>Space complexity: O(1)<\/p>\n\n\n\n<div class=\"responsive-tabs\">\n<h2 class=\"tabtitle\">C++<\/h2>\n<div class=\"tabcontent\">\n\n<pre lang=\"c++\">\nclass Solution {\npublic:\n  int minOperations(vector<int>& nums) {\n    int ans = 0, last = 0;\n    for (int x : nums)    \n      if (x <= last)\n        ans += ++last - x;\n      else\n        last = x;      \n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"<p>You are given an integer array&nbsp;nums&nbsp;(0-indexed). In one operation, you can choose an element of the array and increment it by&nbsp;1. For example, if&nbsp;nums =&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[184],"tags":[20,222],"class_list":["post-8354","post","type-post","status-publish","format-standard","hentry","category-array","tag-array","tag-easy","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8354","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=8354"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8354\/revisions"}],"predecessor-version":[{"id":8356,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8354\/revisions\/8356"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8354"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8354"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8354"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}