TreeSet使用

import java.util.Set;
import java.util.TreeSet;

public class TestTreeSet {
    public static void main(String[] args) {
        Set<Integer> set =new TreeSet<>();
        set.add(300);
        set.add(200);
        set.add(600);
        //按照元素递增的方式排好序
        for(Integer m:set){
            System.out.println(m);
        }
        Set<Emp2> set2=new TreeSet<>();
        set2.add(new Emp2(100,"张三",3000));
        set2.add(new Emp2(50,"李四",2000));
        set2.add(new Emp2(150,"王五",8000));
        set2.add(new Emp2(30,"赵六",20000));
        for(Emp2 m:set2){
            System.out.println(m);
        }
    }
}
class Emp2 implements Comparable<Emp2>{
    int id;
    String name;
    double salary;
    public Emp2(int id, String name, double salary) {
        this.id = id;
        this.name = name;
        this.salary = salary;
    }
    public String toString(){
        return "id:"+id+",name:"+name+",salary:"+salary;
    }



    @Override
    public int compareTo(Emp2 o) {//负数：小于  0：等于  正数：大于
        if(this.salary>o.salary){
            return 1;
        }else if(this.salary>o.salary){
            return -1;
        }else{
            if(this.id>o.id){
                return 1;
            }else if(this.id<o.id){
                return -1;
            }else{
                return 0;
            }
        }
    }
}

200
300
600
id:50,name:李四,salary:2000.0
id:100,name:张三,salary:3000.0
id:150,name:王五,salary:8000.0
id:30,name:赵六,salary:20000.0