毫无难度。

class Solution {
    public int[] exchange(int[] nums) {
        int i = 0;int size = nums.length;
        int[] res = new int[size];
        int j=size-1;
        for(int k =0; k<size;k++){
            if(nums[k]%2 == 0){
                res[j]=nums[k];
                j--;
            }else{
                res[i]=nums[k];
                i++;
            }
        }return res;
    }
}