Let the Balloon Rise <map>的应用
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.
This year, they decide to leave this lovely job to you.
This year, they decide to leave this lovely job to you.
InputInput contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.
A test case with N = 0 terminates the input and this test case is not to be processed.
OutputFor each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.
Sample Input
5 green red blue red red 3 pink orange pink 0
Sample Output
red pink
常规解法:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 | #include<iostream> #include<algorithm> using namespace std; int main() { char str[10000][20],k[100]; int n; while (cin >> n && n != 0) { int a[10000] = { 0 }; int mark = 0; int max = 0,ko = 0; for ( int i = 0; i < n; i++) { int flag = 0; cin >> k; for ( int j = 0; j < mark; j++) { if ( strcmp (str[j], k)==0) { a[j]++; flag = 1; if (a[j] > max) { max = a[j]; ko = j; } break ; } } if (!flag) strcpy (str[mark++], k); } cout << str[ko] << endl; } return 0; } |
map的解法(水题):
1 #include <iostream> 2 #include <map> 3 #include <string> 4 using namespace std; 5 int main() 6 { 7 int ballnum; 8 while (cin >> ballnum && ballnum != 0) 9 { 10 string temp,ko; 11 int bigger = 0; 12 map<string, int> balloon; 13 14 for (int i = 0; i<ballnum; i++) 15 { 16 cin >> temp; 17 balloon[temp]++; 18 if (balloon[temp] > bigger) 19 { 20 bigger = balloon[temp]; 21 ko = temp; 22 } 23 } 24 cout << ko << endl; 25 26 } 27 return 0; 28 }
标签:
zzuli寒假新生训练-STL
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 智能桌面机器人:用.NET IoT库控制舵机并多方法播放表情
· Linux glibc自带哈希表的用例及性能测试
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 手把手教你在本地部署DeepSeek R1,搭建web-ui ,建议收藏!
· 新年开篇:在本地部署DeepSeek大模型实现联网增强的AI应用
· Janus Pro:DeepSeek 开源革新,多模态 AI 的未来
· 互联网不景气了那就玩玩嵌入式吧,用纯.NET开发并制作一个智能桌面机器人(三):用.NET IoT库
· 【非技术】说说2024年我都干了些啥