Let the Ballon Rise

问题描述

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 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.

输出 

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

Inputcopy	Outputcopy
5 green red blue red red 3 pink orange pink 0	red pink

首先要读懂题，题目要求是输入包含多个应用实例，输入包含多个测试用例。每个测试用例以一个数字N（0<N<=1000）开始——分布的气球总数。接下来的N行各包含一种颜色。气球的颜色是最多15个小写字母的字符串。N=0的测试用例终止输入，不处理该测试用例。输完N后，程序对输入内容进行判断，最后输出出现次数最多的颜色，当输入为0时，结束运行。

解题思路：采用两个循环，将k置0，不管进行到第几个数据，都将此数据与所有数据进行比较，利用strcmp函数，若结果等于0，k+1；

定义一个max=0，让k与max进行比较，如果k大于max，将k赋值给max，同时记录此时出现最多次颜色位置的下标，这样就可以知道怎么输出出现多次数据

这里定义一个二维数组是因为要输出多个字符串

#include<stdio.h>
#include<string.h>

char a[1000][1000];//定义二维数组
int main(void)
{
	int n;//测试用例数
	while(scanf("%d",&n),n)
	{
		for(int i=0;i<n;i++)
		scanf("%s",&a[i]);//输入颜色
		int c;
		int max=0;//每次循环清0
		for(int i=0;i<n;i++)
		{
			int k=0;//每次循环清0
			for(int j=0;j<n;j++)
			{
				if(strcmp(a[i],a[j])==0)//判断字符串是否相同
				k++;//计数器加1
			}
			if(k>max)//找到出现次数最多的颜色
		    {
		    	max=k;
		    	c=i;//记录出现最多次颜色位置
			}
		}
		printf("%s\n",a[c]);
		
		
		
	}
	return 0;
}