HDU 1004map的初步使用

最新推荐文章于 2021-02-23 11:14:18 发布

星落之地

最新推荐文章于 2021-02-23 11:14:18 发布

阅读量273

点赞数

分类专栏： STL 文章标签： map stl

本文链接：https://blog.csdn.net/m0_37051465/article/details/78575721

版权

STL 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

本文介绍了如何使用C++的map解决HDU 1004题，通过读取输入的气球颜色计数，找出最流行的气球颜色。每个测试用例包含一个数字N和N种颜色，最后输出出现次数最多的颜色。

摘要由CSDN通过智能技术生成

题目

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.

simpleInput

5
green
red
blue
red
red
3
pink
orange
pink
0

simpleOutput

red
pink

题解

使用map，关联数组的应用，构造函数，map<string,int>关联数组，key，string类型。value，int类型。用颜色的string类型，如“red，green”等做key。而，该颜色出现的次数做value。

代码如下：

#include<iostream>
#include<stdio.h>
#include<string>
#include<cstring>
#include<map>
#include<iterator>
using namespace std;
int main()
{
    map<string,int> ballon;
    int N,i,max;
    string str,maxstr;
    while(~scanf("%d",&N)&&(N!=0)){
            ballon.clear();
            for(i=1;i<=N;i++){
            cin>>str;
            ballon[str]++;
            //遇到key值不同的，创建一个新的map元素，
            //遇到一个key值相同的，在该key的元素value加一
            }
        map<string,int>::iterator itr;
        //迭代器遍历
        max=0;
        for(itr=ballon.begin();itr!=ballon.end();itr++){
            if(max<(itr->second)){
                max=(itr->second);
                maxstr=(itr->first);
                //寻找value最大的数
            }}
            cout<<maxstr<<endl;
    }

}