zoukankan      html  css  js  c++  java
  • PAT 1071. Speech Patterns

    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

    分析

    题目要求的Word定义 Here a "word" is defined as a continuous sequence of alphanumerical characters separated by non-alphanumerical characters or the line beginning/end. 所以 can""can""can 中应该> 是3个单词

    #include<iostream>
    #include<map>
    #include<string.h>
    using namespace std;
    int main(){
    	string input,word,res;
    	int max_cnt=0;
    	getline(cin,input);
    	map<string,int> count;
        input+=".";
    	for(int i=0;i<input.size();i++){
    		if(isalpha(input[i])||isdigit(input[i]))
    		   word+=tolower(input[i]);
    		else if(!word.empty()){
    		   count[word]++;
    		   if(max_cnt<count[word]){
    			  max_cnt=count[word];
    			  res=word;
    	    	}else if(max_cnt==count[word]&&res>word)
    		      res=word;
    		    word.erase(); 
    		}
    	}
    	cout<<res<<" "<<max_cnt<<endl;
    	return 0;
    }
    
  • 相关阅读:
    编译问题汇总
    IAP测试购买失败,Error Domain=SKErrorDomain Code=0 "无法连接到 iTunes Store"
    关于H5移动端调试的那些事
    关于JS中this指向的说明
    关于UIControl响应事件说明
    绝对独创---关于直播(推流-拉流-服务器搭建)
    关于直播
    关于公司视频播放由mp4格式向m3u8格式转换的学习
    关于UIView中的endEditing:的使用
    关于UITableViewCell左滑显示多个功能的实现
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/8397828.html
Copyright © 2011-2022 走看看