book.java

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

package structs;

public class Book extends BookShelf {
	public Page SubStruct;
	public Book Next;
	public Book(String name){
		super(name);
		KeyWords="book";
	}
	public Book(String name,String kwds){
		super(name);
		KeyWords=kwds;
	}
	public String ClassName(){
	   return "Book";
	}
	public boolean hasKWS(String[] keys){
		String[] Keywords=KeyWords.split(" ");
		int m=keys.length;
		int n=Keywords.length;
		boolean has=false;
		for(int i=0;i<m;i++ ){
			for(int j=0;j<n;j++){
				if(keys[i].equals(Keywords[j])){
					return true;
				}
			}
		}
	    return false;
	}
/*	public boolean[] compareTo(String keys){
	  String[] set=keys.split("");
	  return Key.compare(KeyWords.split(" "),set);
	} 
	public boolean hasKWD(String key){
		String[] Keywords=KeyWords.split(" ");
		int n=Keywords.length;
		boolean has=false;
		for(int i=0;i<n;i++ ){
			has=has||(key.equals(Keywords[i]));
		}
		return has;
	}
	*/
	public boolean hasKWS(String keys){
		String[] set=keys.split(" ");
		return hasKWS(set);
		//toker=StringTokenizer(keys,"")
	}
	public Book skByKW(String[] key){
      if(this.hasKWS(key))
      return this;
      if(Next!=null)
       return Next.skByKW(key);	
       return null;    
	}
	
}