想要降低复杂度,就必须用空间来换,开2个数组记录奇数偶数也许,用空间换时间,而用队列记录的话,空间复杂度开销会小一半
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int a[111111];
int main()
{
int n;
while(scanf("%d",&n) != EOF)
{
for(int i=0;i<n;++i)
{
scanf("%d",&a[i]);
}
queue<int >q;
int pos = -1;
int count = 0;
for(int i=0;i<n;++i)
{
if(a[i]&1)
{
a[count++] = a[i];
}
else
{
q.push(a[i]);
}
}
while(!q.empty())
{
a[count++] = q.front();
q.pop();
}
for(int i=0;i<n;++i)
{
if(i != n-1)
printf("%d ",a[i]);
else
printf("%d\n",a[i]);
}
}
return 0;
}