leetCode180|按奇偶排序数组II

示例：

输入：[4,2,5,7]
输出：[4,5,2,7]
解释：[4,7,2,5]，[2,5,4,7]，[2,7,4,5] 也会被接受。
 

提示：

2 <= A.length <= 20000
A.length % 2 == 0
0 <= A[i] <= 1000

public  class SortArrayByParityIITest {
    public static void main(String[] args) {
        int[] array = {4, 2, 5, 7};
        int[] result = sortArrayByParityII(array);
        for (int num : result) {
            System.out.print(num + "\t");
        }
    }

    public static int[] sortArrayByParityII(int[] A) {
        int[] result = new int[A.length];
        if (A == null || A.length == 0) {
            return result;
        }
        int index = 0;
        for (int i = 0; i < A.length; i++) {
            if (A[i] % 2 == 0) {
                result[index] = A[i];
                index += 2;
            }
        }
        index = 1;
        for (int i = 0; i < A.length; i++) {
            if (A[i] % 2 != 0) {
                result[index] = A[i];
                index += 2;
            }
        }
        return result;
    }
}