TreeSet 添加Student实体类数据唯一按升序排序

迈不过友情╰ 2024-03-16 13:20 49阅读 0赞

Student类代码如下所示：

package com.test.Test10;
    
    
    public class Student implements Comparable<Student>{
        private int age;
        private String name;
    
        public int getAge() {
            return age;
        }
    
        public void setAge(int age) {
            this.age = age;
        }
    
    
        public String getName() {
            return name;
        }
    
        public void setName(String name) {
            this.name = name;
        }
    
        public Student(int age, String name) {
            this.age = age;
            this.name = name;
        }
    
        @Override
        public String toString() {
            return "Student{" +
                    "age=" + age +
                    ", name='" + name + '\'' +
                    '}';
        }
    
    
        @Override
        public int compareTo(Student o) {
            //return 0;
            return this.getAge()-o.getAge();
        }
    }
    
    测试类如下所示：

package com.test.Test10;
    
    import java.util.TreeSet;
    
    public class Test03 {
        public static void main(String[] args) {
            //创建一个TreeSet
            TreeSet<Student> ts = new TreeSet<>();
            ts.add(new Student(10,"elili"));
            ts.add(new Student(8,"blili"));
            ts.add(new Student(4,"alili"));
            ts.add(new Student(9,"clili"));
            ts.add(new Student(10,"elili"));
            ts.add(new Student(1,"dlili"));
            System.out.println(ts.size()); //放了6个数据，出来了5个，重复的删除了
            System.out.println(ts);        //[Student{age=1, name='dlili'}, Student{age=4, name='alili'}, Student{age=8, name='blili'}, Student{age=9, name='clili'}, Student{age=10, name='elili'}]
        }
    }