题目描述
解题思路:
代码:
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
string s;
while(getline(cin ,s)){
vector<int> p(s.size(), 0);
for (size_t i = 0;i < s.size();++i)
if (isalpha(s[i]))
p[i] = 1;//是字母的位置置位1,其余位置为0
vector<char> vec;
for (size_t i = 0;i < s.size();++i)
if(p[i])
vec.push_back(tolower(s[i]));//一律转化为小写
sort(vec.begin(), vec.end());//排序
for (size_t i=0;i < vec.size();)
{
char ch = vec[i];
vector<char> tmp;
for (size_t j = 0;j < s.size();++j)
{
if (s[j] == ch || s[j] == toupper(ch))
tmp.push_back(s[j]);
}
//退出上面的for时,tmp保存了源串中的形式
int len = tmp.size();
for (int k = 0;k<len;)//同时递增最外层的i
vec[i++] = tmp[k++];//回填原来的形式
}
//回填到s
for (size_t i = 0, j = 0;i < s.size();++i)
if (p[i])//只填哪些是字母的位置
s[i] = vec[j++];
cout << s << endl;
}
//system("pause");
return 0;
;
}