leetCode174|按奇偶排序数组

示例：

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

提示：

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

import java.util.LinkedList;
import java.util.List;

public  class SortArrayByParityTest {
    public static void main(String[] args) {
        int[] array = {3, 1, 2, 4};
        int[] sortArrayByParity = sortArrayByParity(array);
        for (int num : sortArrayByParity) {
            System.out.print(num + "\t");
        }
    }

    public static int[] sortArrayByParity(int[] A) {
        if (A == null || A.length == 0) {
            return null;
        }
        List<Integer> evenList = new LinkedList<>();
        List<Integer> oddList = new LinkedList<>();
        for (int j : A) {
            if (j % 2 == 0) {
                evenList.add(j);
            } else {
                oddList.add(j);
            }
        }
        evenList.addAll(oddList);
        return evenList.stream().mapToInt(x -> x).toArray();
    }
}