minimum-swaps-to-move-zeros-to-end

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code>.

In one operation, you can choose any two distinct indices <code>i</code> and <code>j</code> and swap <code>nums[i]</code> and <code>nums[j]</code>.

Return an integer denoting the minimum number of operations required to move all 0s to the end of the array.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [0,1,0,3,12]

Output: 2

Explanation:

We perform the following swap operations:

<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>

Thus, the answer is 2.
</div>

Example 2:

<div class="example-block">
Input: nums = [0,1,0,2]

Output: 1

Explanation:

We perform the following swap operations:

<ul>
	<li>Swap <code>nums[0]</code> and <code>nums[3]</code>, giving <code>nums = [2, 1, 0, 0]</code>.</li>
</ul>

Thus, the answer is 1.
</div>

Example 3:

<div class="example-block">
Input: nums = [1,2,0]

Output: 0

Explanation:

The array already satisfies the condition. Therefore, no swap operations are needed.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 100</code></li>
</ul>

Biweekly Contest 183

biweekly-contest-183

minimumSwaps

Mid Level

Minimum Swaps to Move Zeros to End

Array

Two Pointers

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given an integer array nums.

In one operation, you can choose any two distinct indices i and j and swap nums[i] and nums[j].

Return an integer denoting the minimum number of operations required to move all 0s to the end of the array.

 

Example 1:

Input: nums = [0,1,0,3,12]

Output: 2

Explanation:

We perform the following swap operations:

 * Swap nums[0] and nums[3], giving nums = [3, 1, 0, 0, 12].
 * Swap nums[2] and nums[4], giving nums = [3, 1, 12, 0, 0].

Thus, the answer is 2.

Example 2:

Input: nums = [0,1,0,2]

Output: 1

Explanation:

We perform the following swap operations:

 * Swap nums[0] and nums[3], giving nums = [2, 1, 0, 0].

Thus, the answer is 1.

Example 3:

Input: nums = [1,2,0]

Output: 0

Explanation:

The array already satisfies the condition. Therefore, no swap operations are needed.

 

Constraints:

 * 1 <= nums.length <= 100
 * 0 <= nums[i] <= 100