PAT A 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

 

例子有一些迷惑性，例子整个都是输入。

单词到非字母和数字的字符（标点、空格等）即结束。

 

代码：

#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;

int main()
{
	int id=0;	//统计单词数量
	map<string,int> data;	//单词和id的对应关系
	vector<string> word;	//对应id的单词
	vector<int> count;	//对应id的单词的数量
	string s1;
	char c;
	
	word.push_back("0");
	count.push_back(0);
	int i;
	
	while(1)
	{
		s1.clear();
		while(1)	//输入一个单词
		{
			c=cin.get();
			if(c>='A'&&c<='Z')	//！！！根据例子，单词不区分大小写，故直接转换为小写，以便比较和输出
				s1+=c+'a'-'A';
			else if((c>='a'&&c<='z')||(c>='0'&&c<='9'))
				s1+=c;
			else
				break;
		}
		if(!s1.empty())	//单词不为空，即有效
		{
			if(!data[s1])	//单词没出现过，新增对应信息
			{
				count.push_back(1);
				word.push_back(s1);
				data[s1]=++id;
			}
			else			//单词出现过，增加计数
				count[data[s1]]++;
		}
		if(c=='\n')	//到尾部，结束
			break;
	}

	int max=1;
	for(i=2;i<=id;i++)	//输出出现数最多的词
	{
		if(count[i]>count[max])
			max=i;
		else if(count[i]==count[max]&&
			word[i]<word[max])
			max=i;
	}
	cout<<word[max]<<" "<<count[max];

	return 0;
}