libarary.java

Java实现的常用数据结构算法

package Libarary;

public class Libarary {
	private int Counter;
	public BookShelf[] bookShelves;
	private String administrator;
	public char[] Typy;
	public String[] subject; 
	public Libarary(){
		Typy=new char[]{'A','B','C','D','E','F'};
		subject=new String[]{ "Computer","Program" ,"Liteture","Algorithm","Chinese","English"};
		bookShelves=new BookShelf[5];
		for(int i=0;i<5;i++){
			bookShelves[i]=new BookShelf(subject[i],Typy[i]);
		}
	}
	public void input(Book book,char Type) {
		int i=0;
		while (Type !=Typy[i])i++;
		bookShelves[i].appendBook(book);
	}
	public void output(String BookNo) {
		char Type=BookNo.charAt(0);
		int i=0;
		while (Type !=Typy[i])i++;
		bookShelves[i].deletBook(BookNo);
		
	}
	public void rendOut(Book book ,String render) {
		book.rendout(1,render);		
	}
	public void rendOut(String bookname ,String render){		
	}
	public void rendOutByNum(String booknum ,String render){		
	}

	public void checkin(String Name, int PSW) {
	}
	public void search(int BookNO) {
	}
	public void notice(String information) {
	}
	public void seach(String BookName) {
	}
	public void init(){
		Book what=new Book(new String[]{"what","jack","UNC"},2);
		Book how=new Book(new String[]{"how","jack","UNC"},2);
		Book when=new Book(new String[]{"when","jack","UNC"},2);
		Book where=new Book(new String[]{"where","jack","UNC"},2);
		bookShelves[0].appendBook(what);
		bookShelves[0].appendBook(how);
		bookShelves[0].appendBook(when);
		bookShelves[0].appendBook(where);
	}
	public static void main(String args[]){
		Libarary lib=new Libarary();
		lib.init();
		lib.bookShelves[0].display();
	   Book book=lib.bookShelves[0].searchByName("what");
	 	lib.rendOut(book,"lewindom");
	 	System.out.println(book.Numble);
	}
}