題目如下：

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

題目要求從一個自然段（一行句子，包含特殊字符）中找出出現(xiàn)頻率最高的單詞，注意這里的單詞定義，連續(xù)的字符數(shù)字序列，數(shù)字也是合法的。要做出此題目，可以使用getline讀取一行句子，然后遍歷過程中用stringstream接收字符，在處理完一個單詞后輸出，再用map記錄單詞的出現(xiàn)頻率。

①連帶空格讀取一行，使用getline(cin,str);

②分割單詞，對讀到的自然段para，從前到后遍歷，使用一個stringstream記錄讀到的字符串，一旦讀到非法字符，就把當(dāng)前stringstream的內(nèi)容都輸出到一個字符串word，判斷word長度是否大于0，大于0則說明是一個單詞，用map記錄當(dāng)前單詞的出現(xiàn)次數(shù)，并按照題目要求比較，特別注意單詞只出現(xiàn)一次的情況。

③注意如果讀到的自然段para只有一個單詞，沒有除換行符以外的分隔符，需要特殊處理，這是因為getline讀不到\n。

注意點：

①stringstream輸出字符串使用ss.str()。

②清空stringstream不要用ss.clear，應(yīng)該用ss.str("")。

代碼如下：

#include <iostream> #include <map> #include <stdio.h> #include <sstream> #include <string> #include <algorithm>// stringstream 清空使用 ss.str("") // transformusing namespace std;int main() {map<string,int> words;string para;getline(cin,para);stringstream ss;string word;string maxWord = "";int maxCnt = -1;bool singleFlag = true;string single;for(int i = 0; i < para.length(); i++){char c = para[i];if(isalnum(c)){ss << c;if(singleFlag){single = ss.str();}}else{singleFlag = false;word = ss.str();if(word.length() > 0){transform(word.begin(), word.end(), word.begin(), ::tolower);ss.str("");if(words.find(word) == words.end()){words[word] = 1;int cnt = 1;if(cnt > maxCnt){maxCnt = cnt;maxWord = word;}else if(cnt == maxCnt){if(word < maxWord){maxWord = word;}}}else{words[word]++;int cnt = words[word];if(cnt > maxCnt){maxCnt = cnt;maxWord = word;}else if(cnt == maxCnt){if(word < maxWord){maxWord = word;}}}}}}if(singleFlag){printf("%s 1\n",single.c_str(),maxCnt);}else{printf("%s %d\n",maxWord.c_str(),maxCnt);}return 0; }

轉(zhuǎn)載于:https://www.cnblogs.com/aiwz/p/6154079.html

總結(jié)

以上是生活随笔為你收集整理的1071. Speech Patterns (25)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。