java中集合排序

Comparator重写compare实现排序

最新推荐文章于 2024-05-05 15:08:44 发布

原创最新推荐文章于 2024-05-05 15:08:44 发布 · 112 阅读

0 ·

CC 4.0 BY-SA版权

java 专栏收录该内容

85 篇文章

订阅专栏

博客介绍了通过实现Comparator重写compare方法来实现排序，返回1表示从小到大排序，返回 -1 表示从大到小排序，返回 0 也表示从小到大排序，还提到了使用匿名内部类的方式。

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());
                            }
                        });