void reverse(int* arr,int sz)
{
int right = sz - 1;
int left = 0;
while (left < right)
{
if (arr[left] % 2 ==0)
{
if( (arr[right] % 2)==1)
{
int tmp = arr[left];
arr[left] = arr[right];
arr[right] = tmp;
right--;
}
else if (arr[right] % 2 == 0)
{
do
{
right--;
}while (arr[right] % 2 == 0);
int tmp = arr[left];
arr[left] = arr[right];
arr[right] = tmp;
right--;
}
}
left++;
}
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,10,20,15,55,64,54};
int sz = sizeof(arr) / sizeof(arr[0]);
reverse(arr,sz);
int i = 0;
for (i = 0; i < sz; i++)
{
printf("%d ", arr[i]);
}
return 0;
}
使一个数组的奇数位于偶数左边1
最新推荐文章于 2022-03-27 11:07:13 发布