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

分析

此題考查字符串處理勘畔，遍歷字符串捆愁，當遇到空格或者非數(shù)字字母的字符時吴叶，tmp即形成了一個符合要求的word。第一次提交時辫塌，測試點2（從0開始）沒通過顽照，讀題不仔細宅粥，先入為主的判斷<font color="hotpink">以空格為分隔符</font>，仔細檢查發(fā)現(xiàn)吠冤，分隔符不僅可以是空格還可以是非數(shù)字字母的字符檩互，測試點2考查的是這個。

#include <iostream>
#include <map>
#include <cctype>
using namespace std;
map<string,int> mp;
int main(){
    string ans;
    getline(cin,ans);
    string tmp;
    for(int i=0;i<(int)ans.size();i++){
        if(tmp!=""&&(ans[i]==' ' || (isalpha(ans[i])==0 && isdigit(ans[i])==0))){
            mp[tmp]++;
            tmp.clear();
        }else if(isalpha(ans[i]) || isdigit(ans[i])){
            tmp.push_back(tolower(ans[i]));
        }
    }
    if(tmp!="")mp[tmp]++;
    int max_cnt=-1;
    string max_str,tmp_str;
    bool first=true;
    for(auto it: mp){
        if(first){
            first=false;
            tmp_str=it.first;
        }else{
            if(tmp_str>it.first) tmp_str=it.first;
        }
        if(it.second>max_cnt){
            max_cnt=it.second;
            max_str=it.first;
        }
    }
    if(max_cnt>1) cout<<max_str<<" "<<max_cnt;
    else cout<<tmp_str<<" 1";
    return 0;
}