【微软2014实习生】 String reorder

本文介绍了一种处理特定ASCII字符('0'-'9'和'a'-'z')的字符串处理算法,该算法能够将输入字符串中的字符按ASCII顺序重新排列并分成多个子串输出。通过使用C++ map容器统计字符频率并进行排序,实现了字符的有效管理和输出。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

问题描述:

Time Limit: 10000ms
Case Time Limit: 1000ms
Memory Limit: 256MB

Description
For this question, your program is required to process an input string containing only ASCII characters between ‘0’ and ‘9’, or between ‘a’ and ‘z’ (including ‘0’, ‘9’, ‘a’, ‘z’). 
Your program should reorder and split all input string characters into multiple segments, and output all segments as one concatenated string. The following requirements should also be met,
1. Characters in each segment should be in strictly increasing order. For ordering, ‘9’ is larger than ‘0’, ‘a’ is larger than ‘9’, and ‘z’ is larger than ‘a’ (basically following ASCII character order).
2. Characters in the second segment must be the same as or a subset of the first segment; and every following segment must be the same as or a subset of its previous segment. 
Your program should output string “<invalid input string>” when the input contains any invalid characters (i.e., outside the '0'-'9' and 'a'-'z' range).

Input
Input consists of multiple cases, one case per line. Each case is one string consisting of ASCII characters.


Output
For each case, print exactly one line with the reordered string based on the criteria above.

Sample In
aabbccdd
007799aabbccddeeff113355zz
1234.89898
abcdefabcdefabcdefaaaaaaaaaaaaaabbbbbbbddddddee

Sample Out
abcdabcd
013579abcdefz013579abcdefz
<invalid input string>
abcdefabcdefabcdefabdeabdeabdabdabdabdabaaaaaaa


基本思路:利用map容器实现,统计每个字符的个数,然后逐个输出,直到该字符的个数为0。

#include<iostream>
#include<string>
#include<map>
using namespace std;
string errormsg ="<invalid input string>";
string getresult(string str)
{
	map<char,int> mp;
	string reslut ="";
	if(str.empty())
		return errormsg;
	if(str.size()==0)
		return errormsg;

	for(string::size_type i=0;i<str.size();i++)
	{
		char temp= str[i];
		if((temp<='z'&& temp>='a')||(temp<='9'&& temp>='0'))
		{
			mp[temp]++;
		}
		else
		{
			return errormsg;
		}

	}

	bool isover = false;
	while(!isover)
	{
		isover = true;
		map<char,int>::iterator iter = mp.begin();
		for(;iter!=mp.end();iter++)
		{
			if(iter->second>0)
			{
				isover = false;
				reslut +=iter->first;
				iter->second--;
			}
		}
	}
	return reslut;
}
int main(void) {

	string str;
	while(getline(cin,str))
	{
		string res= getresult(str);
		cout<<res<<endl;;
		cin.ignore();
	}
	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值