HUD 1004 Let the Balloon Rise map容器的简单使用

最新推荐文章于 2021-12-03 00:08:21 发布

原创最新推荐文章于 2021-12-03 00:08:21 发布 · 241 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#map容器

Map容器专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一道关于统计比赛中最流行气球颜色的编程题目，通过使用map容器将字符串类型与整数类型关联，实现对多种颜色气球的计数，并找出出现次数最多的颜色。

题目链接

Problem Description
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.
Input
Input 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.
Output
For 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

题目大意与解题思路：
找出最受欢迎的气球颜色，使用map容器将string类型与int类型联系起来即可。

AC代码：

#include<iostream>
#include<stdio.h>
#include<map>
#include<string>
using namespace std;
map<string, int> Map;

int main() {
	int n;
	while (cin >> n&&n) {
		Map.clear();
		string tmp, ans;
		int max_num = 0;
		while (n--) {
			cin >> tmp;
			if (Map.find(tmp) == Map.end()) {
				Map[tmp] = 1;
			}
			else Map[tmp]++;
			if (Map[tmp] > max_num) {
				ans = tmp; max_num = Map[tmp];
			}
		}
		cout << ans << endl;
	}
	return 0;
}