插入排序思想

public class Solution {
    public void reOrderArray(int [] array) {

        for(int i=1;i<array.length;i++){
            if(array[i]%2!=0){
                int insertIndex=i;
                int insertValue=array[i];
                while(insertIndex-1>=0&&array[insertIndex-1]%2==0){
                    array[insertIndex]=array[insertIndex-1];
                    insertIndex--;
                }
                array[insertIndex]=insertValue;
            }
        }

    }
}