PTA甲级 1071 Speech Patterns (C++)

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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-21 16:08:31
// All rights reserved.

#include <iostream>
#include <unordered_map>
#include <algorithm>

using namespace std;

int main(){
    unordered_map<string, int> map;
    int maxTimes = 0;
    string s, ans = "";
    
    getline(cin, s);
    int pos = 0;
    while(pos < s.length() && !(isdigit(s[pos]) || isalpha(s[pos]))) pos++;

    while(pos < s.length()){
        int left = pos;

        while(pos < s.length() && (isdigit(s[pos]) || isalpha(s[pos]))) pos++;

        string sub = s.substr(left, pos - left);
        transform(sub.begin(), sub.end(), sub.begin(), ::tolower);

        if(++map[sub] >= maxTimes){        
            if(map[sub] > maxTimes){
                ans = sub;
                maxTimes = map[sub];
            }

            else{
                if(ans == "") ans = sub;
                else ans = min(ans, sub);
            }    
        }

        while(pos < s.length() && !(isdigit(s[pos]) || isalpha(s[pos]))) pos++;
    }

    printf("%s %d\n", ans.c_str(), maxTimes);

    return 0;
}

在这里插入图片描述

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

负反馈循环

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值