排序的方法:
1.升序
sort(s.begin(),s.end());
2.降序
sort(s.begin(),s.end(),compare);
字符串反轉
reverse(s1.begin(),s1.end());
排序的字符串反轉需要包含的頭函數#include <algorithm>
該題大意:將一個算式變爲小的加數在前邊
代碼
#include <iostream>
#include <algorithm>
using namespace std;
bool compare(char a,char b)
{
return a>b;//降序
}
int main()
{
string s,s1="";
cin>>s;
sort(s.begin(),s.end(),compare);
for(int i=0;i<s.length()/2;i++)
{
int j=s.length()-i-1;
s1=s1+s[i]+s[j];
}
int j=s.length()/2;
s1=s1+s[j];
reverse(s1.begin(),s1.end());
cout<<s1<<endl;
return 0;
}