#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;
}
c++如何巧妙变为c,青高收捷达
- 写回答
- 好问题 0 提建议
- 追加酬金
- 关注问题
- 邀请回答
-
2条回答 默认 最新
- qzjhjxj 2022-07-05 15:58关注
供参考:
#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; }
本回答被题主选为最佳回答 , 对您是否有帮助呢?解决 无用评论 打赏 举报
悬赏问题
- ¥15 java业务性能问题求解(sql,业务设计相关)
- ¥15 52810 尾椎c三个a 写蓝牙地址
- ¥15 elmos524.33 eeprom的读写问题
- ¥15 使用Java milo连接Kepserver服务端报错?
- ¥15 用ADS设计一款的射频功率放大器
- ¥15 怎么求交点连线的理论解?
- ¥20 软件开发方法学习来了
- ¥15 微信小程序商城如何实现多商户收款 平台分润抽成
- ¥15 HC32L176调试了一个通过TIMER5+DMA驱动WS2812B
- ¥15 关于自相关函数法和周期图法实现对随机信号的功率谱估计的matlab程序运行的问题,请各位专家解答!