Add 1827

Author: trung-hn

Readme.md

@@ -487,6 +487,7 @@ https://leetcode.com/jummyegg/
 | 1784 | Check if Binary String Has at Most One Segment of Ones | Easy | O(N) | O(1) | Greedy | | |
 | 1791 | Find Center of Star Graph | Medium | O(1) | O(1) | Graph | | |
 | 1792 | Maximum Average Pass Ratio | Medium | O(N+KlogN) | O(N) | Heap | | |
+| 1827 | Minimum Operations to Make the Array Increasing | Easy | O(N) | O(1) | Array, Greedy | | |
 
 # Useful Posts:
 

src/1827.minimum-operations-to-make-the-array-increasing.py

@@ -0,0 +1,19 @@
+#
+# @lc app=leetcode id=1827 lang=python3
+#
+# [1827] Minimum Operations to Make the Array Increasing
+#
+
+# @lc code=start
+
+
+class Solution:
+    # 136 ms, 100%. Time: O(N). Space: O(1)
+    def minOperations(self, nums: List[int]) -> int:
+        total = 0
+        for i in range(1, len(nums)):
+            if nums[i - 1] >= nums[i]:
+                total += nums[i - 1] - nums[i] + 1
+                nums[i] = nums[i - 1] + 1
+        return total
+# @lc code=end