Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 31.9 MB (0.00%)

Author: koralkulacoglu

LeetCode/4316-minimum-swaps-to-move-zeros-to-end/README.md

@@ -0,0 +1,63 @@
+<p>You are given an integer array <code>nums</code>.</p>
+
+<p>In one operation, you can choose any two <strong>distinct</strong> indices <code>i</code> and <code>j</code> and swap <code>nums[i]</code> and <code>nums[j]</code>.</p>
+
+<p>Return an integer denoting the <strong>minimum</strong> number of operations required to move all 0s to the end of the array.</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 = [0,1,0,3,12]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">2</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>We perform the following swap operations:</p>
+
+<ul>
+	<li>Swap <code>nums[0]</code> and <code>nums[3]</code>, giving <code>nums = [3, 1, 0, 0, 12]</code>.</li>
+	<li>Swap <code>nums[2]</code> and <code>nums[4]</code>, giving <code>nums = [3, 1, 12, 0, 0]</code>.</li>
+</ul>
+
+<p>Thus, the answer is 2.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [0,1,0,2]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">1</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>We perform the following swap operations:</p>
+
+<ul>
+	<li>Swap <code>nums[0]</code> and <code>nums[3]</code>, giving <code>nums = [2, 1, 0, 0]</code>.</li>
+</ul>
+
+<p>Thus, the answer is 1.</p>
+</div>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,2,0]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">0</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The array already satisfies the condition. Therefore, no swap operations are needed.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 100</code></li>
+</ul>

LeetCode/4316-minimum-swaps-to-move-zeros-to-end/solution.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int minimumSwaps(vector<int>& nums) {
+        int n = nums.size();
+        int ans = 0;
+        int zeros = count(nums.begin(), nums.end(), 0);
+        for (int i=n-1; i>=0; i--) {
+            if (zeros == 0) break;
+            int val = nums[i];
+            if (val == 0) {
+                zeros--;
+                continue;
+            }
+            ans++;
+            zeros--;
+        }
+        return ans;
+    }
+};