1071 Speech Patterns (25分)

People often have a preference among synonyms of the same word. For example, some may prefer “the police”, while others may prefer “the cops”. Analyzing such patterns can help to narrow down a speaker’s identity, which is useful when validating, for example, whether it’s still the same person behind an online avatar.

Now given a paragraph of text sampled from someone’s speech, can you find the person’s most commonly used word?
Input Specification:

Each input file contains one test case. For each case, there is one line of text no more than 1048576 characters in length, terminated by a carriage return \n. The input contains at least one alphanumerical character, i.e., one character from the set [0-9 A-Z a-z].
Output Specification:

For each test case, print in one line the most commonly occurring word in the input text, followed by a space and the number of times it has occurred in the input. If there are more than one such words, print the lexicographically smallest one. The word should be printed in all lower case. Here a “word” is defined as a continuous sequence of alphanumerical characters separated by non-alphanumerical characters or the line beginning/end.

Note that words are case insensitive.
Sample Input:

Can1: "Can a can can a can?  It can!"

Sample Output:

can 5

题意：输入一串字符串，统计当中出现次数最多单词(单词只能有大小写字母以及阿拉伯数字组成，不分大小写)；
思路：可以很清楚地判断出需要使用map<string,int>，但是要做到跳过非法字符，以及不要使用cin，因为cin是以空格，换行作为结束标志，需要使用getline()，以换行作为结束标志；大小写的转换也是必须要考虑的问题；

AC

#include<iostream>
#include<string>
#include<map>
using namespace std;
bool check(char c){//判断合法字符
	if(c>='0'&&c<='9')return true;
	if(c>='A'&&c<='Z')return true;
	if(c>='a'&&c<='z')return true;
	return false;
}
int main(){
	map<string,int>mp;
	map<string,int>::iterator it;
	string str;
	getline(cin,str);//读入字符串
	int i=0;
	while(i<str.size()){
		string word;
		while(i<str.size()&&check(str[i])==true){
            if(str[i]>='A'&&str[i]<='Z'){//大小写转换
				str[i]=str[i]+32;
			}
			word=word+str[i];
			i++;
		}
		if(word!=""){//防止开头即为非法字符
			if(mp.find(word)!=mp.end())mp[word]++;
			else mp[word]=1;
		}
		while(i<str.size()&&check(str[i])==false){//跳过非法字符
			i++;
		}
	}
	int max=0;
	string key;
	for(it=mp.begin();it!=mp.end();it++){
		if(it->second>max){
			max=it->second;
			key=it->first;
		}
	}
	printf("%s %d\n",key.c_str(),max);//c_str转化格式
	return 0;
}