HashMap的排序

public class SortByValueDemo {

 public static void main(String[] args) {
  
  HashMap<String, Integer> datas = new HashMap<String, Integer>(){{
   put("Winter Lau", 100);
   put("Yier", 150);
   put("Nothing", 30);
   put("Zolo", 330);
  }};
  
  ByValueComparator bvc = new ByValueComparator(datas);
  
  //第一种方法
  TreeMap<String, Integer> sorted_map = new TreeMap<String, Integer>(bvc);
  sorted_map.putAll(datas);
  
  for(String name : sorted_map.keySet()){
   System.out.printf("%s -> %d\n", name, datas.get(name));
  }

  //第二种方法
  List<String> keys = new ArrayList<String>(datas.keySet());
  Collections.sort(keys, bvc);
  HashMap<String, Integer> tempHashMap =  new HashMap<String, Integer>();
  for(String key : keys) {
   tempHashMap.put(key, datas.get(key));
  }
  System.out.println(tempHashMap);
 }

 static class ByValueComparator implements Comparator<String> {
  HashMap<String, Integer> base_map;

  public ByValueComparator(HashMap<String, Integer> base_map) {
   this.base_map = base_map;
  }

  public int compare(String arg0, String arg1) {
   if (!base_map.containsKey(arg0) || !base_map.containsKey(arg1)) {
    return 0;
   }

   if (base_map.get(arg0) < base_map.get(arg1)) {
    return 1;
   } else if (base_map.get(arg0) == base_map.get(arg1)) {
    return 0;
   } else {
    return -1;
   }
  }
 }

}

建议使用第二种方法，第一种方法中，如果值相同，会损失键值对