教师类-按编号排序

[java]代码库

import java.util.Arrays;
import java.util.Scanner; 
public class Main{ 
    public static void main(String[] args) { 
         Scanner scan = new Scanner(System.in);
         int i;
         int n = scan.nextInt();
         Teacher [] t = new Teacher[n];
         TeacherManagement tm = new TeacherManagement(n);
         for(i = 0; i < n; i++) {
        	 int no = scan.nextInt();
             String name = scan.next();
             int age = scan.nextInt();
             String seminary = scan.next();
             t[i] = new Teacher(no, name, age, seminary);
             tm.add(t[i]);
         }
         Arrays.sort(t);
         for(i = 0; i < n; i++) {
             System.out.println("no: " +t[i].getNo() +", name: " +t[i].getName() +", age: " +t[i].getAge() +", seminary: " +t[i].getSeminary());
         }
         String name = scan.next();
         int age = scan.nextInt();
         tm.search(name);
         tm.search(age);
         
         scan.close();  
    } 
}  

class Teacher implements Comparable{
	public int no;
	public String name;
	public int age;
    public String seminary;
	public Teacher(int _no, String _name, int _age, String _seminary) {
		no = _no;
		name = _name;
		age = _age;
		seminary = _seminary;
	}
	public int getNo() {
		return no;
	}
	public String getName() {
		return name;
	}
	public int getAge() {
		return age;
	}
	public String getSeminary() {
		return seminary;
	}
	public String equals(Teacher t) {
		if(this.no == t.getNo()) {
			return "true";
		}
		else
			return "false";
	}
	public String toString() {
		return "no: " +no +", name: " +name +", age: " +age +", seminary: " +seminary;
	}
	@Override
	public int compareTo(Object o) {
		if(this.no > ((Teacher)o).no) {
			return 1;
		}
		else if(this.no < ((Teacher)o).no) {
			return -1;
		}
		else
			return 0;
	}
}

class TeacherManagement{
	private int n;
	private static int i = 0;
	Teacher [] t;
	public TeacherManagement(int num) {
		n = num;
		t = new Teacher[n];
	}
	public void add(Teacher teacher) {
		t[i] = teacher;
		i++;
	}
	public void search(String name) {
		System.out.println("search by name:");
		int flag = 0;
		for(int i = 0; i < n; i++) {
			if(t[i].getName().equals(name)) {
				flag = 1;
				System.out.println("no: " +t[i].getNo() +", name: " +t[i].getName() +", age: " +t[i].getAge() +", seminary: " +t[i].getSeminary());
			}
		}
		if(flag == 0) {
			System.out.println("no such teacher");
		}
	}
	public void search(int age) {
		System.out.println("search by age:");
		int flag = 0;
		for(int i = 0; i < n; i++) {
			if(t[i].getAge() == age) {
				flag = 1;
				System.out.println("no: " +t[i].getNo() +", name: " +t[i].getName() +", age: " +t[i].getAge() +", seminary: " +t[i].getSeminary());
			}
		}
		if(flag == 0) {
			System.out.println("no such teacher");
		}
	}
}