[剑指offer][Java]调整数组顺序使奇数位于偶数前面

public class Solution {
    private boolean isEven(int n){
        return (n&1) == 0;
    }
    public void reOrderArray(int [] array) {
        if(array.length==0){
            return;
        }
        int left = 0;
        int right = array.length-1;
        while(left<right){
            while(left<right && !isEven(array[left])){
                left++;
            }
            while(left<right && isEven(array[right])){
                right--;
            }
            int temp = array[left];
            array[left] = array[right];
            array[right] = temp;
        }
    }
}

public class Solution {
    public void reOrderArray(int [] array) {
        int count = 0;//记录已经摆好位置的奇数的个数
        int len = array.length-1;
        for (int i = 0; i <= len; i++) {
            if(array[i]%2==1){
                int j = i;
                while(j>count){
                    int temp = array[j];
                    array[j] = array[j-1];
                    array[j-1] = temp;
                    j--;
                }
                count++;
            }
        }
    }
}