【算法笔记】A1071 Speech Patterns

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

题意

　　统计一句话中出现次数最多的单词，输出这个单词和出现次数。注意can1也算一个单词。

思路

　　步骤1：把每个单词从句子里分离出来。

　　步骤2：用map记录出现次数。

　　步骤3：遍历map，输出次数最多的单词。

code：

#include<bits/stdc++.h>
using namespace std;
map<string, int> wordStat;
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;
}
int main(){
    string str, pattern;
    int i = 0, max = 0;
    getline(cin, str);
    while(i < str.length()){
        string word;
        while(i < str.length() && check(str[i])==true){
            if(str[i]>='A'&&str[i]<='Z') str[i] += 32;
            word += str[i];
            i++;
        }
        if(word != ""){
            if(wordStat.find(word) == wordStat.end()) wordStat[word] = 1;
            else wordStat[word]++;
        }
        while(i < str.length() && check(str[i])==false){
            i++;
        }
    }
    for(map<string, int>::iterator it = wordStat.begin(); it!=wordStat.end(); it++){
        if(max <= it->second){
            max = it->second;
            pattern = it->first;
        }
    }
    cout<<pattern<<" "<<max;
    return 0;
}