leetcode 922. Sort Array By Parity II

奇偶位置的交换，注意到边界条件即可

class Solution {
    public int[] sortArrayByParityII(int[] A) {
        if(A.length<=1) return A;
        int p1 = 0,p2 = 1;
        while(p1<A.length && p2<A.length){
            while(p1<A.length && A[p1]%2==0){
                p1+=2;
            }
            if(p1>=A.length) break;
            while(p2<A.length && A[p2]%2==1){
                p2+=2;
            }
            if(p2>=A.length) break;
            int tmp = A[p1];
            A[p1] = A[p2];
            A[p2] = tmp;
            p1+=2;
            p2+=2;
        }
        return A;
    }
}