【剑指Offer】21. 调整数组顺序使奇数位于偶数前面

public class Solution {
    public void reOrderArray(int [] array) {
        int countji = 0;
        for(int i : array) {
            if(!iso(i))
                countji++;
        }
        int[] copy = array.clone();
        int i = 0, j = countji;
        for(int n : copy) {
            if(n % 2 == 1)
                array[i++] = n;
            else
                array[j++] = n;
        }
    }
    private boolean iso(int n) {
        return n % 2 == 0;
    }
}

public class Solution {
    public void reOrderArray(int [] array) {
        int len = array.length;
        for(int i = len-1; i > 0; i--) {
            for(int j = 0; j < i; j++) {
                if(iso(array[j]) && !iso(array[j+1])) 
                    swap(array, j, j+1);
            }
        }
    }
    // 判断偶数
    private boolean iso(int n) {
        return n%2 == 0;
    }
    // 交换
    private void swap(int[] arr, int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}