java中集合排序

1. 实现Comparator 重写compare

return   1  (从小到大)

return   -1 (从大到小)

return   0  (从小到大)

public class SortClass implements Comparator {
 
	@Override
    public int compare(Object o1, Object o2) {
        LogisticsBean.TracesBean tracesBean1 = (LogisticsBean.TracesBean)o1;
        LogisticsBean.TracesBean tracesBean2 = (LogisticsBean.TracesBean)o2;
		int flag = tracesBean1.getAcceptTime().compareTo(tracesBean2.getAcceptTime());
		return flag;
	}
}

排序 

Collections.sort(traces,sortClass);

2. 用匿名内部类

Collections.sort(traces, new Comparator<LogisticsBean.TracesBean>() {
                            @Override
                            public int compare(LogisticsBean.TracesBean tracesBean1, LogisticsBean.TracesBean tracesBean2) {
                                return tracesBean1.getAcceptTime().compareTo(tracesBean2.getAcceptTime());
                            }
                        });