Sync LeetCode submission Runtime - 3 ms (70.62%), Memory - 206.2 MB (90.11%)

Author: koralkulacoglu

LeetCode/3738-make-array-non-decreasing/README.md

@@ -0,0 +1,43 @@
+<p>You are given an integer array <code>nums</code>. In one operation, you can select a <span data-keyword="subarray-nonempty">subarray</span> and replace it with a single element equal to its <strong>maximum</strong> value.</p>
+
+<p>Return the <strong>maximum possible size</strong> of the array after performing zero or more operations such that the resulting array is <strong>non-decreasing</strong>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [4,2,5,3,5]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">3</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>One way to achieve the maximum size is:</p>
+
+<ol>
+	<li>Replace subarray <code>nums[1..2] = [2, 5]</code> with <code>5</code> &rarr; <code>[4, 5, 3, 5]</code>.</li>
+	<li>Replace subarray <code>nums[2..3] = [3, 5]</code> with <code>5</code> &rarr; <code>[4, 5, 5]</code>.</li>
+</ol>
+
+<p>The final array <code>[4, 5, 5]</code> is non-decreasing with size <font face="monospace">3.</font></p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,2,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">3</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>No operation is needed as the array <code>[1,2,3]</code> is already non-decreasing.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 2 * 10<sup>5</sup></code></li>
+</ul>

LeetCode/3738-make-array-non-decreasing/solution.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int maximumPossibleSize(vector<int>& nums) {
+        int n = nums.size();
+        int ans = 0;
+        int mx = 0;
+        for (int num : nums) {
+            if (num >= mx) {
+                mx = num;
+                ans++;
+            }
+        }
+        return ans;
+    }
+};