classSolution{publicint[]sortArrayByParityII(int[] A){int n = A.length;int j =1;for(int i =0; i < n; i +=2){if(A[i]%2==1){while(A[j]%2==1){
j +=2;}swap(A, i, j);}}return A;}publicvoidswap(int[] A,int i,int j){int temp = A[i];
A[i]= A[j];
A[j]= temp;}}
空间换时间的一次遍历结果
classSolution{publicint[]sortArrayByParityII(int[] A){int n = A.length;int[] ans =newint[n];int i =0;for(int x : A){if(x %2==0){
ans[i]= x;
i +=2;}}
i =1;for(int x : A){if(x %2==1){
ans[i]= x;
i +=2;}}return ans;}}