PAT A1071

• 题目：
  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

• 题目大意
  输出一串字符，字符串由 集合[0-9 A-Z a-z]中的字符组成，从输出的字符串中找出出现次数最多的字符串，字母大小写视为相同。

• 分析
  建立一个string 到int 的映射mp,mp中存储的为转化为小写后的字符串的出现次数
  现在主要解决要解决的问题为：
  将字符中的每一个字符串分出来
  注：map<string, int>mp 中，mp的初始值为0，直接计数即可，不需要开不变数组存储下标的值

while( i < len){
        string temp;
        while((str[i] >='0' && str[i] <='9') || (str[i] >='a' && str[i] <='z') || (str[i] >='A' && str[i] <='Z')){
            temp += tolower(str[i]);
            i++;
        }

        mp[temp] = 0;
        while(i < len){                     //找到第一个在这些区间的值
            if((str[i] >='0' && str[i] <='9') || (str[i] >='a' && str[i] <='z') || (str[i] >='A' && str[i] <='Z'))
                break;
            else
                i++;
            }
    }

• 代码实现

#include <map>
#include <string>
#include <iostream>
#include <vector>
#include <cctype>
using namespace std;
int main ()
{
    string str;
    getline(cin, str);
    map<string , int> mp;
    int i = 0,  len = str.length();
    while( i < len){
        string temp;
        while((str[i] >='0' && str[i] <='9') || (str[i] >='a' && str[i] <='z') || (str[i] >='A' && str[i] <='Z')){
            temp += tolower(str[i]);
            i++;
        }

        mp[temp]++;
        while(i < len){                     //找到第一个在这些区间的值
            if((str[i] >='0' && str[i] <='9') || (str[i] >='a' && str[i] <='z') || (str[i] >='A' && str[i] <='Z'))
                break;
            else
                i++;
            }
    }
    string res1;
    int Max = 0;
    for(auto it = mp.begin(); it != mp.end(); it++){
        if(it->second > Max){
            res1 = it->first;
            Max = it->second;
        }
    }
    cout << res1 << " "<< Max;
    return 0;
}