hashCode方法equals方法compareTo方法重写

package set集合.set练习;

public class Student implements Comparable<Student>{
	private String id;
	private String name;
	private int score;
	public Student(String id,String name){
		this(id,name,0);//构造方法之间互相调用
	}
	public Student(){}
	public Student(String id,String name,int score){
		this.id=id;
		this.name=name;
		this.score=score;
	}
	public Student(String id){
		this(id,null,0);//调用三个参数的构造方法
	}
	public String getId() {
		return id;
	}
	public void setId(String id) {
		this.id = id;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public boolean equals(Object obj){
		if(this == obj){
			return true;
		}
		if(obj instanceof Student){
			Student s = (Student)obj;
			if(this.id.equals(s.id)){
				return true;
			}
		}
		return false;
	}
	public int hashCode(){
		return this.id.hashCode();
	}
	//用HashCode就得重写equals和hashCode
	@Override
	//按学号升序排序
//	public int compareTo(Student o) {
		if(this.id < o.id){
			return -1;
		}else if(this.id == o.id){
			return 0;
		}else{
			return 1;
		}
//		return this.id-o.id;
//	}
	public int compareTo(Student o){
		return this.id.compareTo(o.id);
	}
}

package set集合.set练习;

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

public class Test {
	public static void main(String[] args){
		Student stu1 = new Student("001","张三1");
		Student stu2 = new Student("002","张三2");
		Student stu3 = new Student("003","张三3");
		Student stu4 = new Student("004","张三4");
		Student stu5 = new Student("005","张三5");
		Student stu6 = new Student("006","张三6");
		Student stu7 = new Student("007","张三7");
		Student stu8 = new Student("008","张三8");
		Student stu9 = new Student("009","张三9");
		Student stu10 = new Student("010","张三10");
		//String类型比较，得保证长度相等
		Set<Student> set = new TreeSet<Student>();
		set.add(stu1);
		set.add(stu2);
		set.add(stu3);
		set.add(stu4);
		set.add(stu5);
		set.add(stu6);
		set.add(stu7);
		set.add(stu8);
		set.add(stu9);
		set.add(stu10);
		for(Student stu : set){
			System.out.println(stu.getId());
		}
		Scanner sca = new Scanner(System.in);
		System.out.println("请输入学生学号");
		String id= sca.nextLine();
		Student s =new Student(id);
		boolean b = set.contains(s);
		if(b){
			Scanner sca1 = new Scanner(System.in);
			System.out.println("请选择：1，查看信息。2，删除信息");
			String oper = sca1.nextLine();
			if(oper.equals("2")){
				set.remove(s);//s是新创建的对象，和set集合中不是同一对象，
			//但remove方法也能删除，因为remove方法也是用equals和hashCode实现的
				System.out.println("删除成功，当前系统中剩余学生人数"+set.size());
			}else{
				System.out.println("暂时无法实现，因为HashSet中没有get方法（无序无索引）");
			}
		}
//		System.out.println(b);
	} 
}