数据结构120-实现容量恒为质数代码

 <!DOCTYPE html>
<html lang="en">
  <head>
    <meta charset="UTF-8" />
    <meta http-equiv="X-UA-Compatible" content="IE=edge" />
    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
    <title>哈希表的封装</title>
  </head>
  <body>
    <script>
      function hashFunc(str, size) {
        var hashCode = 0;
        //霍纳算法
        for (var i = 0; i < str.length; i++) {
          hashCode = 37 * hashCode + str.charCodeAt(i);
        }
        var index = hashCode % size;
        return index;
      }
      function HashTable() {
        this.storage = [];
        this.count = 0;
        this.limit = 7 * 2;
        //方法
        HashTable.prototype.put = function (key, value) {
          //根据key获取对应的index
          var index = this.hashFunc(key, this.limit);
          //根据index取出对应的bucket
          var bucket = this.storage[index];
          //、
          if (bucket == null) {
            (bucket = []), (this.storage[index] = bucket);
          }
          for (var i = 0; i < bucket.length; i++) {
            var tuple = bucket[i];
            if (tuple[0] == key) {
              tuple[1] = value;
              return;
            }
          }
          bucket.push([key, value]);
          this.count += 1;
          //判断是否需要扩容
          if (this.count > this.limit * 0.75) {
            var newSize=this.limit*2
            var newPrime=this.getPrime(newSize)
            this.resize(newPrime);
          }
        };
        HashTable.prototype.get = function (key) {
          //
          var index = this.hashFunc(key, this.limit);
          //根据index取出对应的bucket
          var bucket = this.storage[index];
          if (bucket == null) {
            return null;
          }
          for (var i = 0; i < bucket.length; i++) {
            var tuple = bucket[i];
            if (tuple[0] == key) {
              return tuple[1];
            }
          }
          return null;
        };
        HashTable.prototype.remove = function (key) {
          var index = this.hashFunc(key, this.limit);
          //根据index取出对应的bucket
          var bucket = this.storage[index];
          if (bucket == null) {
            return null;
          }
          for (var i = 0; i < bucket.length; i++) {
            var tuple = bucket[i];
            if (tuple[0] == key) {
              bucket.splice(i, 1);
              this.count--;
              return tuple[1];
              if (this.limit > 7 && this.count < this.limit * 0.25) {
                this.resize(Math.floor(this.limit / 2));
              }
            }
          }
          return null;
        };
        HashTable.prototype.isEmpty = function (key) {
          return this.count == 0;
        };
        HashTable.prototype.size = function (key) {
          return this.count;
        };
        HashTable.prototype.resize = function (key) {
          var oldStorage = this.storage;
          //重置所有的属性
          this.storage = [];
          this.count = 0;
          this.limit = newLimit;
 
          for (var i = 0; i < bucket.length; i++) {
            var bucket = oldStorage[i];
            if (bucket == null) {
              continue;
            }
            for (var j = 0; j < bucket.length; j++) {
              var tuple = bucket[j];
              this.put(tuple[0], tuple[1]);
            }
          }
        };
        HashTable.prototype.isPrime = function (num) {
          var temp = parseInt(Math.sqrt(num));
          for (var i = 2; i <= temp; i++) {
            if (num % i == 0) {
              return false;
            }
          }
          return true;
        };
        HashTable.prototype.getPrime = function (num) {
            while(!this.isPrime(num)){
                num++
            }
            return num
        }
      }
    </script>
  </body>
</html>

posted @ 2022-12-17 17:26 前端导师歌谣阅读(16) 评论(0) 编辑收藏举报

刷新页面返回顶部

登录后才能查看或发表评论，立即登录或者逛逛博客园首页

相关博文：

· 数据结构114-哈希表的扩容实现代码

· 数据结构102-哈希表的封装代码

· 通关数据结构 day_10 -- 哈希表

· 9.哈希表

· 第五节：哈希表详解(哈希函数、增删改查、扩容/缩容、质数容量优化)

阅读排行：
· 25岁的心里话
· 闲置电脑爆改个人服务器（超详细） #公网映射 #Vmware虚拟网络编辑器
· 基于 Docker 搭建 FRP 内网穿透开源项目（很简单哒）
· 零经验选手，Compose 一天开发一款小游戏！
· 一起来玩mcp_server_sqlite，让AI帮你做增删改查！！

公告

昵称：前端导师歌谣
园龄： 7年3个月
粉丝： 9
关注： 0

+加关注

2025年3月

日

一

二

三

四

五

六

前端导师歌谣的博客

微信公众号关注前端小歌谣每日分享前端知识

数据结构120-实现容量恒为质数代码

公告

搜索

常用链接

最新随笔

我的标签

积分与排名

随笔分类

随笔档案

相册

阅读排行榜

推荐排行榜

	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8" />
	<meta http-equiv="X-UA-Compatible" content="IE=edge" />
	<meta name="viewport" content="width=device-width, initial-scale=1.0" />
	<title>哈希表的封装</title>
	</head>
	<body>
	<script>
	function hashFunc(str, size) {
	var hashCode = 0;
	//霍纳算法
	for (var i = 0; i < str.length; i++) {
	hashCode = 37 * hashCode + str.charCodeAt(i);
	}
	var index = hashCode % size;
	return index;
	}
	function HashTable() {
	this.storage = [];
	this.count = 0;
	this.limit = 7 * 2;
	//方法
	HashTable.prototype.put = function (key, value) {
	//根据key获取对应的index
	var index = this.hashFunc(key, this.limit);
	//根据index取出对应的bucket
	var bucket = this.storage[index];
	//、
	if (bucket == null) {
	(bucket = []), (this.storage[index] = bucket);
	}
	for (var i = 0; i < bucket.length; i++) {
	var tuple = bucket[i];
	if (tuple[0] == key) {
	tuple[1] = value;
	return;
	}
	}
	bucket.push([key, value]);
	this.count += 1;
	//判断是否需要扩容
	if (this.count > this.limit * 0.75) {
	var newSize=this.limit*2
	var newPrime=this.getPrime(newSize)
	this.resize(newPrime);
	}
	};
	HashTable.prototype.get = function (key) {
	//
	var index = this.hashFunc(key, this.limit);
	//根据index取出对应的bucket
	var bucket = this.storage[index];
	if (bucket == null) {
	return null;
	}
	for (var i = 0; i < bucket.length; i++) {
	var tuple = bucket[i];
	if (tuple[0] == key) {
	return tuple[1];
	}
	}
	return null;
	};
	HashTable.prototype.remove = function (key) {
	var index = this.hashFunc(key, this.limit);
	//根据index取出对应的bucket
	var bucket = this.storage[index];
	if (bucket == null) {
	return null;
	}
	for (var i = 0; i < bucket.length; i++) {
	var tuple = bucket[i];
	if (tuple[0] == key) {
	bucket.splice(i, 1);
	this.count--;
	return tuple[1];
	if (this.limit > 7 && this.count < this.limit * 0.25) {
	this.resize(Math.floor(this.limit / 2));
	}
	}
	}
	return null;
	};
	HashTable.prototype.isEmpty = function (key) {
	return this.count == 0;
	};
	HashTable.prototype.size = function (key) {
	return this.count;
	};
	HashTable.prototype.resize = function (key) {
	var oldStorage = this.storage;
	//重置所有的属性
	this.storage = [];
	this.count = 0;
	this.limit = newLimit;

	for (var i = 0; i < bucket.length; i++) {
	var bucket = oldStorage[i];
	if (bucket == null) {
	continue;
	}
	for (var j = 0; j < bucket.length; j++) {
	var tuple = bucket[j];
	this.put(tuple[0], tuple[1]);
	}
	}
	};
	HashTable.prototype.isPrime = function (num) {
	var temp = parseInt(Math.sqrt(num));
	for (var i = 2; i <= temp; i++) {
	if (num % i == 0) {
	return false;
	}
	}
	return true;
	};
	HashTable.prototype.getPrime = function (num) {
	while(!this.isPrime(num)){
	num++
	}
	return num
	}
	}
	</script>
	</body>
	</html>

前端导师歌谣的博客

微信公众号关注前端小歌谣 每日分享前端知识

数据结构120-实现容量恒为质数代码

公告

搜索

常用链接

最新随笔

我的标签

积分与排名

随笔分类

随笔档案

相册

阅读排行榜

推荐排行榜

微信公众号关注前端小歌谣每日分享前端知识