book.java

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

package Libarary;

public class Book {
	public String Name;	
	public String Author;
	public String Pupulm;
	public String Numble;
	public String[] reader; 
	public int Total;
	public int Avaliable;
	public Book(String[] infor,int no){
		Name=infor[0];
		Author=infor[1];
		Pupulm=infor[2];
		reader=new String[infor.length+1];
		Total=no;
		Avaliable=Total;
	}
	public void add(int no) {
		this.Total+=no;
		this.Avaliable+=no;
	}
	public void delet(int no) {
		this.Total-=no;
		this.Avaliable-=no;
	}
	public void rendout(int no ,String user) {		
		reader[getLength()]=user;
		this.Avaliable-=no;
	}
	public void returnBack(int no ,String reader) {		
		this.Avaliable+=no;
		delReader(reader);
	}
	public void delReader(String user){
		int i=0;
		int len=getLength();
		while(i<len&&reader[i]!=user)i++;
		 while(i<len){
		 	reader[i]=reader[i+1];
		 	i++;
		 }					
	}	
	public String[] getRender() {
		int len=getLength();
		String[] names=new String[len];
		for(int i=0;i<len;i++){
			names[i]=reader[i];
		}
		return names;
	}
	public int getLength(){
		return Total-Avaliable;
	}
}