根据List中元素的属性对List进行升序或倒叙排序

package com.micros.nms.summary.monitor.entity.domain.vo;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Date;

public class Test {
    private Date time;
    private String str;
    private Integer quantity;

    public Date getTime() {
        return time;
    }

    public void setTime(Date time) {
        this.time = time;
    }

    public String getStr() {
        return str;
    }

    public void setStr(String str) {
        this.str = str;
    }

    public Integer getQuantity() {
        return quantity;
    }

    public void setQuantity(Integer quantity) {
        this.quantity = quantity;
    }

    @Override
    public String toString() {
        return "Test{" +
                "time=" + time +
                ", str='" + str + '\'' +
                ", quantity=" + quantity +
                '}';
    }

    public static void main(String[] ars){
        ArrayList<Test> objects = new ArrayList<>();
        Test test = new Test();
        test.setTime(new Date());
        test.setStr("2019-08-08 09:18:00");
        test.setQuantity(1);
        //延迟一秒
        try {
            Thread.sleep(1000);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }

        Test test2 = new Test();
        test2.setTime(new Date());
        test2.setStr("2019-08-07 09:18:00");
        test2.setQuantity(1);

        objects.add(test);
        objects.add(test2);

        //降序
            Collections.sort(objects, new Comparator<Test>() {//此处创建了一个匿名内部类,根据时间进行排序
                @Override
                public int compare(Test o1, Test o2) {
                    int result = o1.getTime().compareTo(o2.getTime());
                    if (result > 0) {
                        return -1;
                    } else if (result < 0) {
                        return 1;
                    } else {
                        return 0;
                    }
                }
            });

        /*Collections.sort(objects, new Comparator<Test>() {//此处创建了一个匿名内部类,根据字符串进行排序
            @Override
            public int compare(Test o1, Test o2) {
                int result = o1.getStr().compareTo(o2.getStr());
                if (result > 0) {
                    return -1;
                } else if (result < 0) {
                    return 1;
                } else {
                    return 0;
                }
            }
        });

        Collections.sort(objects, new Comparator<Test>() {//此处创建了一个匿名内部类,根据整数进行排序
            @Override
            public int compare(Test o1, Test o2) {
                int result = o1.getQuantity().compareTo(o2.getQuantity());
                if (result > 0) {
                    return -1;
                } else if (result < 0) {
                    return 1;
                } else {
                    return 0;
                }
            }
        });*/

        //升序将return的结果取反

        for (Test test1:objects){
            System.out.println(test1);
        }
    }

}

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值