HDU1004（STL-map）

最新推荐文章于 2021-08-31 19:49:15 发布

原创最新推荐文章于 2021-08-31 19:49:15 发布 · 465 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#oj平台 #hdu #STL #map

oj平台同时被 3 个专栏收录

6 篇文章

订阅专栏

hdu

3 篇文章

订阅专栏

STL

3 篇文章

订阅专栏

本文介绍了一道编程题目，通过使用STL中的<map>来统计不同颜色气球的数量，并找出数量最多的气球颜色。文章提供了两种解决方案，一种是传统方法使用字符串比较进行计数，另一种则是利用<map>实现更简洁高效的计数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

B - STL之<map>

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 1004

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

题意：给出气球的颜色，输出颜色最大的气球。
分析：
（1）输入字符串，每种分别计数（strcmp），输出最大对应的字符串。

<span style="font-size:18px;">#include<iostream>
#include<cstring>
using namespace std;
int main()
{
    int n,k[1000];
    char a[1000][100];
    while(cin>>n,n)
    {
        int i,j,t;
        for(i=0; i<n; i++)cin>>a[i];
        for(i=0; i<n; i++)
        {
            t=0;
            for(j=0; j<n; j++)
                if(strcmp(a[i],a[j])==0)
                    k[i]=t++;
        }
        t=0;
        for(i=0; i<n; i++)
            if(k[i]>k[t])
                t=i;
        cout<<a[t]<<endl;
    }
    return 0;
}</span>

（2）使用STL——<map>
map中有一一映射的关系,建立color和count之间的关系即map<string,int>ball;
it->first是map中第一个元素，it->second是map中第二个元素

#include <iostream>
#include <cstdio>
#include <string>
#include <map>
using namespace std;
#define N 102
map<string,int>ball;///颜色和个数的映射
map<string,int>::iterator it;
int main()
{
	int n;
	string color;
	while(scanf("%d",&n),n)
    {
        ball.clear();///先清0
        for(int i=0;i<n;i++)
        {
            cin>>color;
            ball[color]++;
        }
        int max=-1;
        for(it=ball.begin();it!=ball.end();it++)///map
        {
            if(it->second>max){
                color=it->first;
                max=it->second;
            }
        }
        cout<<color<<endl;
    }
	return 0;
}