void Process(int a[], int n)
{
if (a == NULL || n < 2)
return;
int low = 0, high = n - 1;
int last = low;
for (int i = 0; i < n; ++i) {
if (a[i] % 2 == 1) {
swap(a, last++, i);
}
}
}
void swap(int a[], int i, int j )
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
调整数组顺序使奇数位于偶数前面
最新推荐文章于 2024-08-15 13:07:02 发布