Java 奇偶分离

public class MiddleHalf {
public static void main(String[] args) {
int[] nums={1,4,3,5,0,3,10};
int[] result=sortArrayByParity(nums);

    for(int data: result){
         System.out.println(data);
     }


}



public static int[] sortArrayByParity(int[] A) {
    int left = 0;
    int right = A.length - 1;
    while (left < right) {
        while ((left < right) && (A[right] % 2 != 0)) {
            right--;
        }
        while ((left < right) && (A[left] % 2 == 0)) {
            left++;
        }
        int temp = A[left];
        A[left] = A[right];
        A[right] = temp;
        right--;
        left++;
    }
    return A;
}




public static int getHalfSum(int[] n){
    int sum=0,total=0;
    for(int i=0;i<n.length;i++){
        sum=sum+n[i];
    }
    for(int j=0;j<n.length;j++){
        total=total+n[j];
        if(total==sum){
            return  j;
        }
        sum=sum-n[j];
    }
    return  -1;

}

}