hashtable基于线性探测法的底层原理java实现

最新推荐文章于 2022-12-13 22:10:21 发布

nicalaos

最新推荐文章于 2022-12-13 22:10:21 发布

阅读量629

点赞数

分类专栏： java 文章标签： hashtable基于线性探测法的底层原理java实现

本文链接：https://blog.csdn.net/m0_37867129/article/details/83786538

版权

java 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

package Algorithms;

public class LinearProbingHashST<Key,Value> {

public static void main(String[] args) {
// TODO Auto-generated method stub

   }
   private int N;
   private int M;
   private Key[] keys;
   private Value[] vals;

   public LinearProbingHashST(int M) {
       keys=(Key[]) new Object[M];
       vals=(Value[]) new Object[M];
   }

   private int hash(Key key) {
       return (key.hashCode()&0x7fffffff)%M;
   }

   private void resize(int cap) {
       LinearProbingHashST<Key,Value> t;
       t=new LinearProbingHashST<Key,Value>(cap);
       for(int i=0;i<M;i++){
           if(keys[i]!=null)
               t.put(keys[i],vals[i]);
           keys=t.keys;
           vals=t.vals;
           M=t.M;
       }
   }

   private void put(Key key,Value val) {
       if(N>=M/2) resize(2*M);
       int i;
       for(i=hash(key);keys[i]!=null;i=(i+1)%M) {
           if(keys[i].equals(key)) {
               vals[i]=val;
               return;
           }
       }
       keys[i]=key;
       vals[i]=val;
       N++;
   }

   private Value get(Key key) {
       for(int i=hash(key);keys[i]!=null;i=(i+1)%M) {
           if(keys[i].equals(key)) {
               return vals[i];
           }
       }
       return null;
   }

   public void delete(Key key) {
       if(!contains(key)) return;
       int i=hash(key);
       while(!key.equals(keys[i]))
           i=(i+1)%M;
           keys[i]=null;
           vals[i]=null;
           i=(i+1)%M;
           while(keys[i]!=null) {
               Key keyToReDo=keys[i];
               Value valTodo=vals[i];
               keys[i]=null;
               vals[i]=null;
               N--;
               put(keyToReDo,valTodo);
               i=(i+1)%M;
           }
           N--;
           if(N>0&&N==M/8) resize(M/2);
   }
}