Speech Patterns (25)

1、题目：

题目描述

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?

 

输入描述:

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].

输出描述:

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.

 

输入例子:

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

 

输出例子:

can 5

2、思路：

这种类型的 题目往往都是双指针来做，但是我好像也还是不太熟练，容易在细节处理，比如说何时给i赋值为j上面。

i从合法的开始，让j给i，j一直往后跑，直到跑到不合法的位置，这期间，把跑过的字符存入word，放到哈希表中，根据它的数字对其进行加一操作

还有一个知识点是，map容器的整体使用，我之前只熟悉了存，但是没有熟悉，unordere_map也是一个像数组一样的，也是能够遍历的。first指的是关键字，second是键值，看代码。

3、代码：

#include<iostream>
#include<unordered_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;
}

char to_lower(char c)
{
	if(c >= 'A' && c <= 'Z') return c + 32 ;
	return c;
}

int main()
{
	string str;
	getline(cin,str);
	unordered_map<string,int> hash;
	
	for(int i = 0;i < str.size(); i++)
		if(check(str[i]))
		{
			string word;
			int j = i;
			while(j < str.size() && check(str[j])) word += to_lower(str[j++]);
			
			hash[word] ++;
			i = j;	
		}
	string word;
	int cnt = -1;
	for(auto item : hash)
	{
		if(item.second > cnt || item.second==cnt && item.first < word)	
		{
			word = item.first;
			cnt = item.second;
		}
	}
	cout << word << " " << cnt << endl;
	return 0; 
}