华为历年真题（数组题6）

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
 
bool cmp(int &a,int &b)
{

  return (a>b);
}


void changnum(int *input,int n,int *output)
{
   vector<int> vecOdd,vecEven;//Odd存放奇数、Even存放偶数
   for(unsigned i=0;i<n;i++)
   {
     if(input[i]%2==0)
        vecEven.push_back(input[i]);
     else
        vecOdd.push_back(input[i]);
   }
   sort(vecOdd.begin(),vecOdd.end());//奇数按升序排列
   sort(vecEven.begin(),vecEven.end(),cmp);//偶数按降序排列
   
   unsigned len1=vecOdd.size(),len2=vecEven.size();
   unsigned k1=0,k2=0,j=0;
   while(k1<len1 && k2<len2)
   {
     output[j++]=vecOdd[k1++];
     output[j++]=vecEven[k2++];
   }
   while(k1<len1)
     output[j++]=vecOdd[k1++];
    while(k2<len2)
     output[j++]=vecEven[k2++];

}

void main()
{
    const int n=6;
    int input[n]={1,3,5,7,9,0};
    int output[n];
    changnum(input,n,output);
    for(int i=0;i<n;i++)
        cout<<output[i]<<" ";
    cout<<endl;
}