import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;
public class BalloonRise2 {
public static void main(String args[])
{
HashMap<String,Integer> map = new HashMap<String,Integer>();
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
while(true) {
if(n == 0)break;
while(n!=0)
{
String key = cin.next(); // 用hashMap保存输入数据的Key,Value保存出现次数
if(map.containsKey(key))
map.put(key,map.get(key)+1);
else
map.put(key, 1);
--n;
}
Set<Map.Entry<String,Integer>> entry = map.entrySet();
int max = 0;String maxString = null;
for(Iterator<Entry<String, Integer>> it = entry.iterator();it.hasNext();)
{
Map.Entry<String, Integer> p = it.next();
//System.out.println(p.getKey()+" "+p.getValue());
if(p.getValue()>max)
{
max = p.getValue();
maxString = p.getKey();
}
}
map.clear();
System.out.println(maxString);
n = cin.nextInt();
if(n == 0)break;
}
}
}
HDU--1004 Let the Balloon Rise
最新推荐文章于 2021-08-23 16:43:39 发布