运用LinkedHashSet将List中重复的元素去除

List中存放若干学生对象（学生有学号，姓名，性别等属性），去除List中重复的元素，并按学号降序输出。

package zuoye;
import edu.Student;

import java.util.*;

public class Test7 {
    public static void main(String[] args) {
        LinkedHashSet<Student> list=  new LinkedHashSet<Student>();
        list.add(new Student(2444,"张三",'M'));
        list.add(new Student(2447,"李四",'W'));
        list.add(new Student(2442,"王麻子",'M'));
        list.add(new Student(2444,"张三",'M'));
        System.out.println(list);
        List li=new LinkedList(list);
        Collections.sort(li);
        System.out.println(li);

    }
}

Student类：

package edu;

import lombok.Data;

import java.util.Objects;
@Data
public class Student implements Comparable {
    private int id;
    private String name;
    private char sex;
    @Override
    public String toString() {
        return "Student{" +
                "id=" + id +
                ", name='" + name + '\'' +
                ", sex=" + sex +
                '}';
    }
    public Student(int id, String name, char sex) {
        this.id = id;
        this.name = name;
        this.sex = sex;
    }
    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Student student = (Student) o;
        return id == student.id &&
                sex == student.sex &&
                Objects.equals(name, student.name);
    }

    @Override
    public int hashCode() {

        return Objects.hash(id, name, sex);
    }

    @Override
    public int compareTo(Object o) {
        if(o instanceof Student){
            Student s=(Student)o;
            if (this.id>s.id){
                return -1;
            }else if (this.id<s.id){
                return 1;
            }else
                return 0;
        }
            throw new RuntimeException("类型不匹配，无法比较大小！");

运行结果：

如果有不懂的地方可以私信我，进行询问。