算法导论-OpenAddressHashList开放寻址散列表-java实现

package datastructure;

public class OpenAddressHashList {
public static void main(String args[]){
OpenAddressHashList hash=new OpenAddressHashList(5);
hash.insert(0);
hash.insert(2);
hash.insert(4);
hash.insert(6);
hash.insert(8);
//hash.insert(10);

hash.display();
}
private Item[] items;
private int maxSize;
public OpenAddressHashList(int maxSize){
this.maxSize=maxSize;
items=new Item[maxSize];
}
public int insert(int k){
int i=0,j;
do{
j=h(k,i);
if(items[j]==null){
items[j]=new Item();
items[j].value=k;
return j;
}
else{
i=i+1;
}
}while(i<maxSize);
return -1;
}
public int search(int k){
int i=0,j;
do{
j=h(k,i);
if(items[j].value==k){
return j;
}
i=i+1;
}while(items[j]!=null && i<maxSize);
return -1;
}
public void display(){
for(int i=0;i<items.length;i++){
if(items!=null){
System.out.println(i+"号位置:"+items[i].value);
}
}
}
public int h(int k,int i){
return (k+i)%maxSize;
}
}
class Item{
public int value;
}