#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
//奇数顺序、偶数逆序
vector<int> change(vector<int> arr)
{
vector<int> arr1;
vector<int> arr2;
vector<int>::iterator it=arr.begin();
for(;it!=arr.end();++it)
{
if(*it%2==0)//偶数
{
arr2.push_back(*it);
}
else
{
arr1.push_back(*it);
}
}
sort(arr1.begin(),arr1.end());
sort(arr2.begin(),arr2.end(),greater<int>());
it=arr2.begin();
for(;it!=arr2.end();++it)
{
arr1.push_back(*it);
}
return arr1;
}
int main()
{
vector<int>arr;
int tmp;
while(cin>>tmp)
{
arr.push_back(tmp);
}
// int arr1[10]={23,12,14,75,23,9,2,7,5,11};
// vector<int> arr(arr1,arr1+10);
vector<int> ret;
ret=change(arr);
vector<int>::iterator it=ret.begin();
for(;it!=ret.end();++it)
{
cout<<*it<<" ";
}
return 0;
}
【笔试题】将奇数放前边,偶数放后边
最新推荐文章于 2020-05-05 00:13:26 发布