[leetcode] problem 905 – sort array by parity

Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.

You may return any answer array that satisfies this condition.

Example

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

Code

public int[] sortArrayByParity(int[] A) {
    int left = 0;
    int right = A.length - 1;

    while (left < right) {   
        if (A[left] % 2 > A[right] % 2) {
            int temp = A[left];
            A[left] = A[right];
            A[right] = temp;
        }
                    
        if (A[left] % 2 == 0)
            left++; 

        if (A[right] % 2 > 0)
            right--;
    }

    return A;
}

[leetcode] problem 905 – sort array by parity

Example

No.1

Note

Code

近期文章

近期评论

标签

热门

文章归档

分类目录

功能