sort-array-by-parity

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code>, move all the even integers at the beginning of the array followed by all the odd integers.

Return any array that satisfies this condition.

&nbsp;
Example 1:

<pre>
Input: nums = [3,1,2,4]
Output: [2,4,3,1]
Explanation: The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
</pre>

Example 2:

<pre>
Input: nums = [0]
Output: [0]
</pre>

&nbsp;
Constraints:

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

sortArrayByParity

Sort Array By Parity

Sort Array By Parity II

sort-array-by-parity-ii

按奇偶排序数组 II

Sort Even and Odd Indices Independently

sort-even-and-odd-indices-independently

对奇偶下标分别排序

Largest Number After Digit Swaps by Parity

largest-number-after-digit-swaps-by-parity

按奇偶性交换后的最大数字

Array

Two Pointers

Sorting

给你一个整数数组 <code>nums</code>，将 <code>nums</code> 中的的所有偶数元素移动到数组的前面，后跟所有奇数元素。

返回满足此条件的 任一数组 作为答案。

&nbsp;

示例 1：

<pre>
输入：nums = [3,1,2,4]
输出：[2,4,3,1]
解释：[4,2,3,1]、[2,4,1,3] 和 [4,2,1,3] 也会被视作正确答案。
</pre>

示例 2：

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

&nbsp;

提示：

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

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier! Saves Data!