move-zeroes

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array <code>nums</code>, move all <code>0</code>&#39;s to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

&nbsp;
Example 1:
<pre>Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]
</pre>Example 2:
<pre>Input: nums = [0]
Output: [0]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>-231 &lt;= nums[i] &lt;= 231 - 1</code></li>
</ul>

&nbsp;
Follow up: Could you minimize the total number of operations done?

moveZeroes

Move Zeroes

Remove Element

remove-element

移除元素

Apply Operations to an Array

apply-operations-to-an-array

对数组执行操作

Array

Two Pointers

给定一个数组 <code>nums</code>，编写一个函数将所有 <code>0</code> 移动到数组的末尾，同时保持非零元素的相对顺序。

请注意&nbsp;，必须在不复制数组的情况下原地对数组进行操作。

&nbsp;

示例 1:

<pre>
输入: nums = <code>[0,1,0,3,12]</code>
输出: <code>[1,3,12,0,0]</code>
</pre>

示例 2:

<pre>
输入: nums = <code>[0]</code>
输出: <code>[0]</code></pre>

&nbsp;

提示:
<meta charset="UTF-8" />

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>-231&nbsp;&lt;= nums[i] &lt;= 231&nbsp;- 1</code></li>
</ul>

&nbsp;

进阶：你能尽量减少完成的操作次数吗？