1071. Speech Patterns (25)【字符串操作】——PAT (Advanced Level) Practise

题目信息

1071. Speech Patterns (25)

时间限制300 ms

内存限制65536 kB

代码长度限制16000 B

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

解题思路

字符串读入时直接转换成小写并计数每个单词出现个数

AC代码

[code]#include <cstdio>
#include <string>
#include <map>
using namespace std;
char s[1150000];
int main()
{

    int ch, p = 0;
    map<string, int> mp;
    while ((ch = getchar()) != '\n'){
        if ((ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z') || (ch >= '0' && ch <= '9')){
            s[p++] = tolower(ch);
        }else{
            if (p > 0){
                s[p] = '\0';
                ++mp[s];
                p = 0;
            }
        }
    }
    if (p > 0){
        s[p] = '\0';
        ++mp[s];
    }
    int mx = mp.begin()->second;
    string ms = mp.begin()->first;
    for (map<string, int>::iterator it = mp.begin(); it != mp.end(); ++it){
        if (it->second > mx){
            mx = it->second;
            ms = it->first;
        }
    }
    printf("%s %d\n", ms.c_str(), mx);
    return 0;
}

个人游戏推广：



《10云方》与方块来次消除大战!