map按照value排序

1.首先需要用到下面这个类：

package com.bean;

import java.util.Comparator;
import java.util.Map;

public class ValueComparator implements Comparator<String>{
	Map<String, Integer> base;  
    public ValueComparator(Map<String, Integer> map) {  
        this.base = map;  
    }  
  
    // Note: this comparator imposes orderings that are inconsistent with equals.      
    public int compare(String a, String b) {  
        if (base.get(a) >= base.get(b)) {  
            return -1;  
        } else {  
            return 1;  
        } // returning 0 would merge keys  
    }  
}

2.测试类

System.out.println(kk);

public static void main(String[] args) {
Map<String, Integer> map = new HashMap<>();
ValueComparator bvc = new ValueComparator(map);
TreeMap<String, Integer> sorted_map = new TreeMap<String, Integer>(bvc);
map.put("a", 11); 
map.put("b", 21);
map.put("c", 3);
map.put("g", 7);
map.put("h", 8);
map.put("i", 9);
map.put("j", 10);
map.put("k", 11);
map.put("d", 4);
map.put("e", 5);
map.put("f", 6);
sorted_map.putAll(map);
System.out.println(sorted_map);
Iterator<String> ite = sorted_map.keySet().iterator();
while(ite.hasNext()){
// System.out.println(ite.next()); //ite.next()不能出现两次

           String str = ite.next();

           System.out.println(str);

 }
}

sorted_map的值   ：   {b=21, k=11, a=11, j=10, i=9, h=8, g=7, f=6, e=5, d=4, c=3}

以下是str的输出 ：

b
k
a
j
i
h
g
f
e
d
c