<<Java语言程序设计>>进阶篇 Exercise22_7

import java.util.*;

public class Exercise22_7{
public static void main(String[] args){

Scanner input = new Scanner(System.in);

Map<Integer,Integer> map = new TreeMap<Integer,Integer>();
Set<Integer> set = new HashSet<Integer>();
int key;
while((key =input.nextInt()) != 0){
if (!set.contains(key)){
map.put(key,1);
}
else{
int value = map.get(key).intValue();
value++;
map.put(key,value);
}
set.add(key);
}

LinkedList<Integer> list = new LinkedList<Integer>(map.values());

Integer maxvalue = Collections.max(list);

Set<Map.Entry<Integer,Integer>> entrySet =map.entrySet();

for(Map.Entry<Integer,Integer> entry: entrySet){
if((entry.getValue()).compareTo(maxvalue)==0)
System.out.println(entry.getKey());
}
}