JAVA HashMap、TreeMap根据value值排序

package com.dooioo.test;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;

public class Sort {
	public static void main(String[] args) {
		HashMap<String, Integer> map = new HashMap<String, Integer>();
		map.put("aaa", 3);
		map.put("bbb", 2);
		map.put("ccc", 5);
		map.put("ddd", 1);
		ArrayList<Map.Entry<String, Integer>> list = new ArrayList<Map.Entry<String, Integer>>(
				map.entrySet());
		
		Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {

			public int compare(Entry<java.lang.String, Integer> arg0,
					Entry<java.lang.String, Integer> arg1) {
				//从大到小
				return arg1.getValue() - arg0.getValue();
			}

		});

		for (int i = 0; i < list.size(); i++) {
			Map.Entry<String, Integer> entry = list.get(i);
			System.out.println("key " + entry.getKey() + "--------->value "
					+ entry.getValue());
		}

		/*
		 * 如果想要将结果再放到一个map里面则可再new一个map，如此：map<String,ArrayList<Map.Entry<String,
		 * Integer>>
		 */
	}
}