905. Sort Array By Parity

[Tcdian]

905. Sort Array By Parity

给定一个非负整数数组 A，返回一个数组，在该数组中， A 的所有偶数元素之后跟着所有奇数元素。

你可以返回满足此条件的任何数组作为答案。

Example 1

Input: [3,1,2,4]
Output: [2,4,3,1]
The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.

Note

• 1 <= A.length <= 5000
• 0 <= A[i] <= 5000

[Tcdian]

Solution

• JavaScript Solution

/**
 * @param {number[]} A
 * @return {number[]}
 */
var sortArrayByParity = function(A) {
    let d = -1;
    for (let i = 0; i < A.length; i++) {
        if (A[i] % 2 === 0) {
            swap(i, ++d);
        }
    }
    return A;

    function swap(x, y) {
        const temp = A[x];
        A[x] = A[y];
        A[y] = temp;
    }
};

• TypeScript Solution

/**
 * @param {number[]} A
 * @return {number[]}
 */
var sortArrayByParity = function(A) {
    let d = -1;
    for (let i = 0; i < A.length; i++) {
        if (A[i] % 2 === 0) {
            swap(i, ++d);
        }
    }
    return A;

    function swap(x, y) {
        const temp = A[x];
        A[x] = A[y];
        A[y] = temp;
    }
};