public class Solution { public void reOrderArray(int [] array) { if (array.length<=1){ return; } int l=-1;//奇数范围 int i=0;//当前指针 while (i<array.length) { if(array[i]%2==1){ if(i-l<=2){ swap(array,i+...
