算法:调整数组顺序使奇数位于偶数前面

public class Solution {
    public void reOrderArray(int[] array) {
        if (array == null || array.length <= 1) return;

        for (int i = 0; i < array.length - 1; i++) {
            for (int j = 0; j < array.length - 1 - i; j++) {
                if (array[j] % 2 == 0 && array[j + 1] % 2 == 1) {
                    swap(array, i, j);
                }
            }
        }
    }

    private static void swap(int[] array, int i, int j) {
        int t = array[j];
        array[j] = array[j + 1];
        array[j + 1] = t;
    }
}