leetcode刷题记录 easy(6) 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 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. 1 <= A.length <= 5000
2. 0 <= A[i] <= 5000

中文题目解释：

给定一个A非负整数数组，返回一个由所有偶数元素组成的数组A，后跟所有奇数元素A。

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

例1：

输入：[3,1,2,4]

输出：[2,4,3,1] 产出[4,2,3,1]，[2,4,1,3]和[4,2,1,3]也将被接受。

注意：

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

解析：

遍历数组A，满足偶数的值正序放入新数组，满足奇数的值倒序放入新数组即可

提交结果：

 

class Solution {
    public int[] sortArrayByParity(int[] A) {
        int[] B=new int[A.length];
        int start=0;
        for(int i=0;i<A.length;i++){
            if(A[i]%2==0){
                B[i-start]=A[i];
            }else{
                B[A.length-start-1]=A[i];
                start++;
            }
        }
        return B;
    }
}