java中list存放对象后根据自定义排序策略排序

1、list中放入对象，根据对象的value自定义排序规则。

```java
package com.wucw.springboot_1.test;

import java.util.Objects;

public class Student{

    public Student(String name,String dec){
        this.dec = dec;
        this.name = name;
    }
    private String name ;
    private String dec;


    public String getName() {
        return name;
    }

    public String getDec() {
        return dec;
    }

    public void setName(String name) {
        this.name=name;
    }

    public void setDec(String dec) {
        this.dec=dec;
    }

    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", dec='" + dec + '\'' +
                '}';
    }

    @Override
    public boolean equals(Object o) {
        if(this == o) {return true;}
        if(o == null || getClass() != o.getClass()){ return false;}
        Student student=(Student) o;
        return Objects.equals(name,student.name) &&
                Objects.equals(dec,student.dec);
    }

    @Override
    public int hashCode() {
        return Objects.hash(name,dec);
    }
}

package com.wucw.springboot_1.test;

import java.util.*;

public class Sort {

    public static void main(String[] args) {
        //排序：ti>pc>ul>kl>yl
        List<Student> students = testList();
        //排序策略
        List<String> list = Arrays.asList("ti","pc","ul","kl","yl");
        //重写比较器排序
        /*Collections.sort(students,new Comparator<Student>() {
            @Override
            public int compare(Student o1,Student o2) {
                //获取描述中的值在list中位置
                int io1 = list.indexOf(o1.getDec());
                int io2 = list.indexOf(o2.getDec());
                //返回整数，根据位置大小，正序或者倒序。
                return io1-io2;
            }
        });*/
        //lambda表达式
        Collections.sort(students,(o1,o2) -> {
            //获取描述中的值在list中位置
            int io1 = list.indexOf(o1.getDec());
            int io2 = list.indexOf(o2.getDec());
            //返回整数，根据位置大小，正序或者倒序。
            return io1-io2;
        });
 
        System.out.println("已排序数据");
        for (Student student : students) {
            System.out.println(student);
        }
    }

    public static List<Student> testList(){
        //通过随机数，生成student对象列表
        List<Student> students = new ArrayList<>();
        int i = 1;
        Random random = new Random();
        for (int j = 0; j < 1; j++) {
            i = random.nextInt(10);
        }
        if(i<3){
            //排序：ti>pc>ul>kl>yl
            students.add(new Student("zhangsan","kl"));
            students.add(new Student("zhangsan","yl"));
            students.add(new Student("zhangsan","ul"));
            students.add(new Student("zhangsan","ti"));
            students.add(new Student("zhangsan","pc"));
            students.add(new Student("lisi","kl"));
            students.add(new Student("lisi","yl"));
            students.add(new Student("lisi","ti"));
            students.add(new Student("lisi","pc"));
        }else if(i>3 && i<6){
            students.add(new Student("wangwu","kl"));
            students.add(new Student("wangwu","ul"));
            students.add(new Student("wangwu","ti"));
            students.add(new Student("wangwu","pc"));
            students.add(new Student("zhaoliu","kl"));
            students.add(new Student("zhaoliu","yl"));
            students.add(new Student("zhaoliu","ul"));
            students.add(new Student("zhaoliu","ti"));
        }else{
            students.add(new Student("wangwu2","yl"));
            students.add(new Student("wangwu2","ul"));
            students.add(new Student("wangwu2","ti"));
            students.add(new Student("wangwu2","pc"));
            students.add(new Student("zhaoliu2","kl"));
            students.add(new Student("zhaoliu2","ul"));
            students.add(new Student("zhaoliu2","ti"));
            students.add(new Student("zhaoliu2","pc"));
        }
       System.out.println("未排序数据");
        for (Student student : students) {
            System.out.println(student);
        }
    }
}

运行结果 //排序：ti>pc>ul>kl>yl 符合自定义排序要求