#include<iostream>
#include<map>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
typedef std::pair<std::string, int> WordStat;
typedef std::map<std::string, int>::iterator WordIterator;
bool cmpfunc(const WordStat& l, const WordStat& r) {
return l.second == r.second ? l.first < r.first : l.second > r.second;
}
int main()
{
int testNum;
std::cin >> testNum;
while (testNum--)
{
int lineNum;
std::cin >> lineNum;
std::cin.ignore();
std::string line;
std::map<std::string, int> wordMap;
while (lineNum--)
{
std::getline(std::cin, line);
std::string word = "";
bool lastCharIsAlpha = 0;
int i = 0;
while (i < line.size())
{
while (i < line.size() && !isalpha(line[i]))++i;
word = "";
while (i < line.size() && isalpha(line[i]))
{
word += line[i];
++i;
}
if (!word.empty())
{
wordMap[word]++;
}
}
}
std::vector<WordStat>words;
for (WordIterator iter = wordMap.begin(), iterEnd = wordMap.end(); iter != iterEnd; ++iter)
{
words.push_back(std::make_pair(iter->first, iter->second));
}
std::sort(words.begin(), words.end(), cmpfunc);
for (int i = 0; i < words.size(); ++i)
{
std::cout << words[i].first << " " << words[i].second << std::endl;
}
}
return 0;
}
供参考:
#include <string.h>
#include <stdio.h>
char str[200] = { 0 };
int strC[200] = { 0 };
char tags[200][20] = {0};
int main()
{
int i = 0, k = 0, flg, t, T, line;
char tmp[20];
scanf("%d", &T);
getchar();
while (T--) {
scanf("%d", &line);
getchar();
i = 0;
memset(strC, 0, sizeof(int) * 200);
memset(tags, 0, sizeof(char) * 200 * 20);
while (line--) {
gets(str);
char* p = strtok(str, " ,.\'\"\"");
while (p != NULL) {
t = sscanf(p, "%[a-zA-Z]", tmp);
if (t == 1) {
for (k = 0, flg = 1; flg && k < i; k++) {
if (strcmp(tags[k], tmp) == 0) {
strC[k]++;
flg = 0;
}
}
if (flg) {
strC[i]++;
strcpy(tags[i++], tmp);
}
}
p = strtok(NULL, " ,.\'\"\"");
}
}
for (flg = 0; flg < i - 1; flg++) {
for (k = 0; k < i - 1 - flg; k++) {
if (strC[k] < strC[k + 1]) {
strcpy(tmp, tags[k]);
strcpy(tags[k], tags[k + 1]);
strcpy(tags[k + 1], tmp);
t = strC[k]; strC[k] = strC[k + 1]; strC[k + 1] = t;
}
else if (strC[k] == strC[k + 1] && strcmp(tags[k], tags[k + 1]) > 0) {
strcpy(tmp, tags[k]);
strcpy(tags[k], tags[k + 1]);
strcpy(tags[k + 1], tmp);
t = strC[k]; strC[k] = strC[k + 1]; strC[k + 1] = t;
}
}
}
for (k = 0; k < i; k++)
printf("%s %d\n", tags[k], strC[k]);
}
return 0;
}
替换其中的相关的C++的部分,比如库函数,头文件等