输入一个整数数组,实现一个函数来调整该数组中的数字顺序,是的奇数位于该数组的前半部分,偶数位于该数组的后半部分
#include<iostream>
using namespace std;
void reorderodd_even(int *a, unsigned int length)//12345
{
if (a == NULL || length == 0){
return;
}
int *pBegin = a;
int *pEnd = a + length-1;
while (pBegin < pEnd){
while (pBegin < pEnd && (*pBegin % 2 == 1)){
++pBegin;
}
while (pBegin < pEnd && (*pEnd % 2 == 0)){
--pEnd;
}
if (pBegin < pEnd){
*pBegin = (*pBegin) ^ (*pEnd);
*pEnd = (*pBegin) ^ (*pEnd);
*pBegin = (*pEnd) ^ (*pBegin);
}
}
}
int main()
{
int a[]={1,2,3,4,5,6,7,8,9};
unsigned int length = sizeof(a)/sizeof(a[0]);
reorderodd_even(a,length);
for (int i = 0; i < length; i++){
cout << a[i] << " ";
}
return 0;
}
测试结果: