LeetCode-922-数组排序2

大概意思是数组中索引号为奇数的数字也要为奇数，索引号为偶数的数字也要为偶数，我之前写的代码有问题，先上反例

class Solution {
    public int[] sortArrayByParityII(int[] A) {
        int N = A.length;
        int[] ans = new int[N];
        for(int i = 0;i<N;i = i+2){
//该处只有if语句判断，容易造成漏判，下面同理
//而且用两个if语句很麻烦，所以想办法把条件都写到一个for循环中，一次循环结束
            if(A[i]%2 == 0){
                ans[i] = A[i];
            }
        }
         for(int i = 1;i<N;i = i+2){
            if(A[i]%2 == 1){
                ans[i] = A[i];
            }
        }

        return ans;
    }
}

经过修改，以下代码

class Solution {
    public int[] sortArrayByParityII(int[] A) {
        int N = A.length;
        int[] ans = new int[N];
        for(int m = 0, n = 1,i = 0;i<N;i++){
            if(A[i]%2  == 0){
                ans[m] = A[i];
                m = m+2;
            }else{
                ans[n] = A[i];
                n = n+2;
            }
        }
        return ans;
    }
}