标签：case 25 word text Patterns while Speech && input

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

代码： 

#include<iostream>
#include<map>
using namespace std;
int main()
{
    string str="",s1="a";
    map<string,int> word;
    char c;
    int max=0;
    c=getchar();
    while(c!='\n')
    {
        while((c>='a'&&c<='z')||(c>='A'&&c<='Z')||(c>='0'&&c<='9'))
        {
            if(c>='A'&&c<='Z')
                s1[0]=c-'A'+'a';
            else
                s1[0]=c;
            str+=s1;
            c=getchar();
        }
        if(str.size()!=0)
        {
            if(word.find(str)!=word.end())
                word[str]++;
            else
                word[str]=1;
            if(word[str]>max)
                max=word[str];
            str="";
        }
        while(!((c>='a'&&c<='z')||(c>='A'&&c<='Z')||(c>='0'&&c<='9'))&&c!='\n')//用while将所有非有效数字全部跳过，否则最后一个测试点会运行超时
            c=getchar();
    }
    for(map<string,int>::iterator it=word.begin();it!=word.end();it++)
        if(it->second==max)
        {
            cout<<it->first<<" "<<it->second;
            return 0;
        }
    return 0;
}

标签：case,25,word,text,Patterns,while,Speech,&&,input
来源： https://blog.csdn.net/fairylyt/article/details/123032787

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。