zoukankan      html  css  js  c++  java
  • 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. 

    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
    常规解法:
    #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 }
  • 相关阅读:
    Git学习的网址
    (转)读懂diff
    如何让Beamer的logo放在右上角
    测试面试的一些分享
    python学习-使用制表符或者换行符来添加空白
    python学习-python变量的命名和使用
    python学习-运行.py时,python做了啥
    2020年,很特殊的1年
    python md5验签
    postman使用当前时间戳
  • 原文地址:https://www.cnblogs.com/kangdong/p/8453775.html
Copyright © 2011-2022 走看看