让气球升起来的题解

虽然是学校算法平台上的一道题目，不过解答的人少，所以拿出来讲一下。
题目：
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

根据题目，很容易可以看出，题目的要求是先输入一个数字N，紧接着有N行数据，每一行输入一种颜色，输完N后，程序对输入内容进行判断，最后输出出现最多次数的颜色，而当输入的N为0时，结束运行。
废话不多说，上代码。

总结一下这道题容易出错的地方：
1.因为是用英文来描述的题目，所以像我这种英语不好的就容易出现错误，比如题目要求有多个数据，并且当N=0时结束运行等。
2.需要想到如何纪录出现最多次的那个数据的位置，不然在输出的时候就不知道要怎么输出出现多次的数据了。