自定义排序

List<MyNode> list = new ArrayList<>();
list.add(new MyNode(1,"AA"));
list.add(new MyNode(2,"CC"));
list.add(new MyNode(-1,"BB"));
Collections.sort(list, new Comparator<MyNode>() {
@Override
public int compare(MyNode o1, MyNode o2) {
return o1.id - o2.id;
}
});
for (int i = 0; i < list.size(); i++) {
System.out.println(list.get(i));
}
//MyNode{id=-1, name='BB'}
//MyNode{id=1, name='AA'}
//MyNode{id=2, name='CC'}
Collections.sort(list, new Comparator<MyNode>() {
@Override
public int compare(MyNode o1, MyNode o2) {
return o1.name.compareTo(o2.name);
}
});
for (int i = 0; i < list.size(); i++) {
System.out.println(list.get(i));
}
//MyNode{id=1, name='AA'}
//MyNode{id=-1, name='BB'}
//MyNode{id=2, name='CC'}

（1）Comparator.compare(o1, o2)，o1-o2为升序，o1.compareTo(o2)为升序；o2-o1为降
序，o2.compareTo(o1)为降序。Compare返回值为正数的时候就要交换o1,o2的顺序，负数和
零的时候不交换o1,o2顺序。