通过实现接口Comparator的compare方法实现TreeSet自定义排序、Map排序

 Comparator是对集合对象或者数组进行排序的比较器接口，实现该接口的public compare(T o1,To2)方法即可实现排序,该方法主要是根据第一个参数o1,小于、等于或者大于o2分别返回负整数、0或者正整数

import java.util.Comparator;

TreeSet中按照String长度比较String 排序输出 不重复

TreeSet<String> tree = new TreeSet<>(new Comparator<String>(){
   @Override
   public int compare(String a, String b){
      return a.length() - b.length();
   }
});
tree.add("aaa");
tree.add("bbbb");
tree.add("cc");
tree.add("d");
tree.add("cc");
System.out.println("sort of TreeSet: "+tree);

输出：
[d, cc, aaa, bbbb]

TreeMap默认按照key升序排列

// TreeMap默认按照key升序排列
Map<String,String> sortByKey = new TreeMap<String,String>(new Comparator<String>() {
   @Override
   public int compare(String o1, String o2) {
      return o1.compareTo(o2);
   }
});
sortByKey.put("bbb","bb");
sortByKey.put("aaaa","a");
sortByKey.put("cc","ccc");
sortByKey.put("d","dddd");
System.out.println("sort by key default: "+sortByKey);

输出：
{aaaa=a, bbb=bb, cc=ccc, d=dddd}

TreeMap按value排序

/*
* TreeMap按value排序
* */
// map.EntrySet()转换成list
List<Map.Entry<String,String>> list = new ArrayList<Map.Entry<String, String>>(sortByKey.entrySet());
// 通过list的排序方法重写比较方法compare
Collections.sort(list, new Comparator<Map.Entry<String, String>>(){
   @Override
   public int compare(Map.Entry<String, String> o1, Map.Entry<String, String> o2) {
      // value从大到小排序
      return -o1.getValue().compareTo(o2.getValue());
   }
});
System.out.println("sort by value:"+list);

输出：
[d=dddd, cc=ccc, bbb=bb, aaaa=a]

 HashMap无序，是按照key算出的hashCode排序的，HashMap排序方法和TreeMap排序方法类似

/*
* HashMap无序，是按照key的hashCode排序的
* HashMap排序方法和TreeMap排序方法类似
* */
Map<String, String> hashMap = new HashMap<>();
hashMap.put("fff","bb");
hashMap.put("aaaa","a");
hashMap.put("cc","ccc");
hashMap.put("d","dddd");
// 默认输出：{cc=ccc, d=dddd, fff=bb, aaaa=a}
System.out.println("HashMap: "+hashMap);
List<Map.Entry<String,String>> hashMapList = new ArrayList<>(hashMap.entrySet());
Collections.sort(hashMapList, new Comparator<Map.Entry<String, String>>() {
   @Override
   public int compare(Map.Entry<String, String> o1, Map.Entry<String, String> o2) {
      return o1.getValue().compareTo(o2.getValue());
   }
});
System.out.println(hashMapList);

输出：
//排序之后输出的是list  
[aaaa=a, fff=bb, cc=ccc, d=dddd]