key.java

来自「Java实现的常用数据结构算法」· Java 代码 · 共 62 行

package structs;
public class Key{
    Struct struct;
	String KeyWords;
	public Key(Struct struct){
		this.struct=struct;
		KeyWords=struct.KeyWords;
	}  
   public  boolean[] compare(String[] keys){
   	    String[] Keywords=KeyWords.split(" ");
   	 	int m=keys.length;
		int n=Keywords.length;
		boolean has=false;
		boolean[] rec=new boolean[m];
		for(int i=0;i<m;i++ ){
			rec[i]=false;
			for(int j=0;j<n;j++){
				if(keys[i].equals(Keywords[j])){
					rec[i]=true;
				}
			}
		}
	    return rec;
   }

   public  boolean[] compare(String keys){
   	  return compare(keys.split(" "));
   }
   	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 compare(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,"")
	}
 
}