集合排序，求出最大值，最小值，排序

package com.xuli.test;import java.util.ArrayList;import java.util.Collection;import java.util.Collections;import java.util.Iterator;import java.util.List;import java.util.Map;import java.util.Random;import java.util.Set;import java.util.TreeMap;//public class CollectionHomework{public static void main(String[] args){Map map = new TreeMap();//存储数字机器出现的次数（key为数字，value为出现的次数）Random random = new Random();for(int i = 0; i < 50; i++){int number = random.nextInt(41) + 10;Integer in = new Integer(number);if(map.get(in) == null){map.put(in,new Integer(1));}else{int value = ((Integer)map.get(in)).intValue();map.put(in, new Integer(value + 1));}}Collection clos = map.values();Integer maxoccurs = (Integer)Collections.max(clos);Set set = map.entrySet();List list = new ArrayList();//存储出现次数最大的数字for(Iterator iter = set.iterator();iter.hasNext();){Map.Entry entry = (Map.Entry)iter.next();Integer key = (Integer)entry.getKey();Integer value = (Integer)entry.getValue();if(value.intValue() == maxoccurs.intValue()){list.add(key);}System.out.println(key + " : " + value);}System.out.println("出现次数最多的是：" + maxoccurs);System.out.println("这些数字是");for(Iterator iter = list.iterator();iter.hasNext();){System.out.println(iter.next());}}}