Java SE 050 使用集合重新实现作业

Java SE 050 使用集合重新实现作业

1.作业题

package com.javase.zuoye;

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 RandomTest {
	@SuppressWarnings("unchecked")
	public static void main(String[] args) {
		Map map = new TreeMap();
		
		Random random = new Random();
		for(int i = 0; i < 50; i++){
			int in= random.nextInt(41)+10;
			Integer key = new Integer(in);
			if(map.get(key)==null){
				map.put(key, new Integer(1));
			}else{
				int value =((Integer)map.get(key)).intValue();
				map.put(key, new Integer(value+1));
			}
		}
		//获得随机数出现最多的次数
		Collection coll = map.values();
		int max = Collections.max(coll);
		//存储数字出现次数最大的数字
		List list = new ArrayList();
		
		//遍历map 统计每个随机数出现的次数
		Set set = map.entrySet();
		for(Iterator iter = set.iterator(); iter.hasNext();){
			Map.Entry entry = (Map.Entry) iter.next();
			Integer key = (Integer)entry.getKey();
			Integer value = (Integer)entry.getValue();
			System.out.println(key +"出现"+value+"次");
			if(value.intValue() == max){
				list.add(entry.getKey());
			}
		}
		System.out.println("随机数出现的最大次数："+max);
		for(Iterator iter = list.iterator();iter.hasNext();){
			System.out.println("出现次数最多的随机数是："+iter.next());
		}
	}
}