华为OJ字符串排序

冷不防 2022-06-18 08:17 244阅读 0赞

<table style="border-spacing:0px; border-collapse:collapse; width:960px; margin-bottom:35px; table-layout:fixed; color:rgb(92,92,92); font-family:glober,'Helvetica Neue',Helvetica,Arial,'Lantinghei SC','Hiragino Sans GB','Microsoft YaHei','Wenquanyi Micro Hei',sans-serif; font-size:14px; line-height:20px"> 
 <tbody style=""> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 描述</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> <pre style="overflow:hidden; font-family:monospace,monospace; font-size:1em; white-space:pre-wrap; word-wrap:break-word; line-height:24px">编写一个程序，将输入字符串中的字符按如下规则排序。规则1：英文字母从A到Z排列，不区分大小写。&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;如，输入：Type&nbsp;输出：epTy规则2：同一个英文字母的大小写同时存在时，按照输入顺序排列。&nbsp;&nbsp;&nbsp;&nbsp;如，输入：BabA&nbsp;输出：aABb规则3：非英文字母的其它字符保持原来的位置。&nbsp;&nbsp;&nbsp;&nbsp;如，输入：By?e&nbsp;输出：Be?y样例：&nbsp;&nbsp;&nbsp;&nbsp;输入：&nbsp;&nbsp;&nbsp;A&nbsp;Famous&nbsp;Saying:&nbsp;Much&nbsp;Ado&nbsp;About&nbsp;Nothing(2012/8).&nbsp;&nbsp;&nbsp;&nbsp;输出：&nbsp;&nbsp;&nbsp;A&nbsp;aaAAbc&nbsp;dFgghh:&nbsp;iimM&nbsp;nNn&nbsp;oooos&nbsp;Sttuuuy&nbsp;(2012/8). </pre> </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 知识点</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 字符串,排序</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 运行时间限制</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 10M</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 内存限制</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 128</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 输入</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 输出</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 样例输入</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> A Famous Saying: Much Ado About Nothing (2012/8).</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 样例输出</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> A aaAAbc dFgghh: iimM nNn oooos Sttuuuy (2012/8).</td> 
 </tr> 
 </tbody> 
</table>

#include <iostream> 
 #include <string> 
 #include <vector>
 #include <algorithm>
 
 using namespace std;
 
 void SplitAlpha(string src, string &dst)
 {
 	for (int i = 0; i < src.length(); i++)
 	{
 		if (isalpha(src[i]))
 		{
 			dst.push_back(src[i]);
 		}
 	}
 }
 
 void Sort(string &str)
 {
 	for (int i = 1; i < str.length(); i++)
 	{
 		char tmp = str[i];
 		int j = i - 1;
 		for (j; j >= 0; j--)
 		{
 			if (toupper(tmp) < toupper(str[j]))
 			{
 				str[j + 1] = str[j];
 			}
 			else
 				break;
 		}
 
 		str[j + 1] = tmp;
 	}
 }
 
 int main()
 {
 	string src, dst;
 	getline(cin, src);
 
 	SplitAlpha(src, dst);
 	Sort(dst);
 
 	int i = 0, j = 0;
 	for (i, j; i < src.length() && j < dst.length(); i++)
 	{
 		if (isalpha(src[i]))
 		{
 			src[i] = dst[j];
 			j++;
 		}
 	}
 	cout << src;
 	
 	return 0;
 }