Title: Enter an array of integers to implement a function to adjust the order of the numbers in the array, so that all the odd digits are in the first half of the array, all the even digits are located in the second half of the array, and the relative positions of the odd and odd, even and even are guaranteed.
Idea: Build an array, sweep both sides, first fill in the odd number, the second time to fill in even, then the original array cover ....
Public voidReorderarray (int[] Array) { int[] res=New int[Array.Length]; intIndex=0; for(inti=0;i<array.length;i++){ if(!isodd (Array[i])) {Res[index]=Array[i]; Index++; } } for(inti=0;i<array.length;i++){ if(IsOdd (Array[i])) {Res[index]=Array[i]; Index++; } } for(inti=0;i<array.length;i++) {Array[i]=Res[i]; } } Public BooleanIsOdd (intNumber ) { if(number%2==0) return true; Else return false; }
Adjust array order is odd digits before even number