map遍历排序2方法

public class TreeMapTest {
	public static void main(String[] args){
		  Map<Integer, String> map = new HashMap<Integer, String>();
		  map.put(5, "wang");
		  map.put(3, "shen");
		  map.put(8, "wan");
		  map.put(6, "zhang");
		  map.put(9, "qian");
		  
		  
		  TreeMap<Integer,String> treemap = new TreeMap<Integer,String>(map);//通过treeMap的key自动排序
		  //方法一
		/*  Set<Integer> set = treemap.keySet(); 
		  for (Integer s:set) {
		   System.out.println(s+","+treemap.get(s));
		  }*/
		  //方法二
		  Set<Map.Entry<Integer, String>> entryseSet=map.entrySet();
		  for (Map.Entry<Integer, String> entry:entryseSet) {
		   System.out.println(entry.getKey()+","+entry.getValue());
		  }
		 }
}