leetCode171|调整数组顺序时奇数位于偶数前面

示例：

输入：nums = [1,2,3,4]
输出：[1,3,2,4] 
注：[3,1,2,4] 也是正确的答案之一。
 

提示：

1 <= nums.length <= 50000
1 <= nums[i] <= 10000

import java.util.ArrayList;
import java.util.List;

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

    public static int[] exchange(int[] nums) {
        List<Integer> oddList = new ArrayList<>(nums.length >> 1);
        List<Integer> evenList = new ArrayList<>(nums.length >> 1);
        for (int i = 0; i < nums.length; i++) {
            if ((nums[i] & 1) == 1) {
                oddList.add(nums[i]);
            } else {
                evenList.add(nums[i]);
            }
        }
        oddList.addAll(evenList);
        return oddList.stream().mapToInt(x -> x).toArray();
    }
}