给定一个长度位2N的数组,奇数和偶数个数相同,实现一个算法,使得奇数放在奇数位,偶数放在偶数位。
思路,两指针从头到尾扫描,遇见奇数放在偶数位,和偶数放在奇数位就停下,交换内容。时间复杂度O(n),空间复杂度O(1).
#include <iostream>
using namespace std;
class solution{
public:
void swap(int *a, int *b){
int c = *a;
*a = *b;
*b = c;
}
void arrange(int *arr, int size){
int i = 0, j = 1;
while (true){
while (arr[i] & 1) i += 2;
while ((arr[j] & 1) == 0) j += 2;
swap(&arr[i], &arr[j]);
i += 2;
j += 2;
if (i >= size || j >= size) break;
}
}
};
int main(int argc, const char * argv[])
{
solution sl;
int arr[] { 2, 1, 6, 4, 3, 5, 8, 9, 7, 10 };
sl.arrange(arr, 10);
for (int i = 0; i < 10; i++){
cout << arr[i] << ",";
}
system("pause");
return 0;
}