List 排序

  • 实体实现 Comparable 接口
@Data
public class Example implements Comparable <Example>  {

    private String name;
    private Integer age;

    public Example(String name, Integer age) {
        this.name = name;
        this.age = age;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) {
            return true;
        }

        if (o == null || getClass() != o.getClass()) {
            return false;
        }
        Example example = (Example) o;
        return Objects.equals(name, example.name) &&
                Objects.equals(age, example.age);
    }

    @Override
    public int hashCode() {
        return Objects.hash(name, age);
    }
    @Override
    public int compareTo(Example o) {
        if (o.age.equals(this.age)) {
            return this.name.compareTo(o.name);
        }else {
            return o.age-this.age;
        }
    }

    public static void main(String[] args) {


        Example example0 = new Example("张三", 9);
        Example example1 = new Example("张三", 4);
        Example example2 = new Example("离三", 6);

        List<Example> demo = new ArrayList<>();
        demo.add(example0);
        demo.add(example1);
        demo.add(example2);
        Collections.sort(demo);
        System.out.println(demo);
    }

}

[
Example(name=张三, age=9),
Example(name=离三, age=6),
Example(name=张三, age=4)
]

  • 使用匿名内部类进行排序
public static void main(String[] args) {


        Example example0 = new Example("张三", 9);
        Example example1 = new Example("张三", 4);
        Example example2 = new Example("离三", 6);

        List<Example> demo = new ArrayList<>();
        demo.add(example0);
        demo.add(example1);
        demo.add(example2);
        Collections.sort(demo,new Comparator<Example> (){

            @Override
            public int compare(Example o1, Example o2) {
                return o2.age-o1.age;
            }
        });
        System.out.println(demo);
    }

[
Example(name=张三, age=9),
Example(name=离三, age=6),
Example(name=张三, age=4)
]

  • stream 排序
    public static void main(String[] args) {


        Example example0 = new Example("张三", 9);
        Example example1 = new Example("张三", 4);
        Example example2 = new Example("离三", 6);

        List<Example> demo = new ArrayList<>();
        demo.add(example0);
        demo.add(example1);
        demo.add(example2);

        demo = demo.stream().sorted(
                Comparator.comparing(Example::getAge)
                        .reversed())
                .collect(Collectors.toList());

        System.out.println(demo);
    }

[
Example(name=张三, age=9),
Example(name=离三, age=6),
Example(name=张三, age=4)
]

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值