1071 Speech Patterns

最新推荐文章于 2025-01-02 01:02:14 发布

伍振仁のblog

最新推荐文章于 2025-01-02 01:02:14 发布

阅读量381

点赞数

CC 4.0 BY-SA版权

分类专栏： pat 甲级

本文链接：https://blog.youkuaiyun.com/a553650885/article/details/86713205

pat 同时被 2 个专栏收录

39 篇文章

订阅专栏

甲级

25 篇文章

订阅专栏

本文介绍了一个使用C++实现的简单文本分析程序，该程序能够读取一段文本并统计其中出现频率最高的单词。通过遍历输入的字符串，程序将所有字母转换为小写并忽略非字母数字字符，然后利用map数据结构来统计每个单词的出现次数。最终，程序输出出现次数最多的单词及其频率。

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

markeddown怎么没有分割线功能了?
本来还想一边看教程一边写呢,没想到写博客的各个网页都同步了…闹心
这道题属于水题,就不多说了,另外map的first和second真心好用

#include <cstdio>
#include <iostream>
#include <ctype.h>
#include <map>
#include <string>
using namespace std;
int main() {
	string s, ans;
	getline(cin, s);
	map<string, int> mp;
	for (int i = 0; i < s.size(); i++ ) {
		ans = "";
		if (isalnum(s[i])) {
			while (isalnum(s[i])) {
				s[i] = towlower(s[i]);
				ans += s[i];
				i++;
			}
			mp[ans]++;
			//printf("%c mp[%s] = %d, \n", s[i], ans.c_str(), mp[ans]);
		}
	}
	int max = 0;
	for (auto it = mp.begin(); it != mp.end(); it++) {
		if (it->second > max) {
			max = it->second;
			ans = it->first;
		 }
	}
	printf("%s %d", ans.c_str(), max);
}

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