Map集合排序

package com.text;

import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;

public class Test {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Map<String,Integer> aMap = new HashMap<String,Integer>();

        // adding keys and values
        aMap.put("a", 20);
        aMap.put("b", 80);
        aMap.put("c", 80);
        aMap.put("d",110);
        aMap.put("e",110);
        aMap.put("f", 30);
        
        Set<Entry<String,Integer>> mapEntries = aMap.entrySet();
        List<Entry<String,Integer>> aList = new LinkedList<Entry<String,Integer>>(mapEntries);
        //对集合value进行排序
        Collections.sort(aList,new Comparator<Entry<String,Integer>>() {
            @Override
            public int compare(Entry<String, Integer> entry1,
                    Entry<String, Integer> entry2) {
                return entry1.getValue().compareTo(entry2.getValue());
            }
        });

        
      ///再创建一个可以保存插入顺序的Map
        //HashMap不保存顺序，LinkedHashMap会保存顺序
        Map<String,Integer> map=new LinkedHashMap<String, Integer>();
        
        for (Entry<String,Integer> entry:aList){
            map.put(entry.getKey(), entry.getValue());
        }
        
        System.out.println(map);
        for (Entry<String, Integer> entry:map.entrySet()){
            
            System.out.println(entry.getKey()+"-"+entry.getValue());
        }
    }

}