> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0905-sort-array-by-parity.md).

# 0905. Sort Array By Parity

<https://leetcode.com/problems/sort-array-by-parity>

## Description

Given an integer array `nums`, move all the even integers at the beginning of the array followed by all the odd integers.

Return ***any array** that satisfies this condition*.

**Example 1:**

```
**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.
```

**Example 2:**

```
**Input:** nums = [0]
**Output:** [0]
```

**Constraints:**

* `1 <= nums.length <= 5000`
* `0 <= nums[i] <= 5000`

## ac

```java
```
