哈希表（散列表）原理详解

最新推荐文章于 2024-05-06 13:34:38 发布
QQ倾
最新推荐文章于 2024-05-06 13:34:38 发布
阅读量193
点赞数 2
分类专栏：哈希表文章标签：数据结构
哈希表专栏收录该内容
1 篇文章 0 订阅
订阅专栏
                        
  				版权声明：本文为博主原创文章，未经博主允许不得转载。					https://blog.csdn.net/yyyljw/article/details/80903391				</div>
							            <link rel="stylesheet" href="https://csdnimg.cn/release/phoenix/template/css/ck_htmledit_views-f57960eb32.css">
					<div class="htmledit_views" id="content_views">
            <p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">什么是哈希表？</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp;</span><span style="color:rgb(46,46,46);">哈希表（Hash table，也叫散列表），是</span><span style="color:rgb(255,0,0);">根据关键码值(Key value)而直接进行访问的数据结构。也就是说，它通过把关键码值映射到表中一个位置来访问记录，以加快查找的速度。</span><span style="color:rgb(51,51,51);">这个映射函数叫做</span><span style="color:rgb(0,0,255);">散列函数</span><span style="color:rgb(51,51,51);">，存放记录的数组叫做</span><span style="color:rgb(0,0,255);">散列表</span><span style="color:rgb(51,51,51);">。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">记录的存储位置=f(关键字)</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">这里的对应关系f称为散列函数，又称为哈希（Hash函数），采用散列技术将记录存储在一块连续的存储空间中，这块连续存储空间称为散列表或哈希表（Hash table）。</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">哈希表hashtable(key，value) 就是把Key通过一个固定的算法函数既所谓的哈希函数转换成一个整型数字，然后就将该数字对数组长度进行取余，取余结果就当作数组的下标，将value存储在以该数字为下标的数组空间里。</span><span style="color:rgb(51,51,51);">（或者：</span><span style="color:rgb(51,51,51);">把任意长度的输入（又叫做预映射， pre-image），通过散列算法，变换成固定长度的输出，该输出就是散列值。这种转换是一种压缩映射，也就是，散列值的空间通常远小于输入的空间，不同的输入可能会散列成相同的输出，而不可能从散列值来唯一的确定输入值。简单的说就是一种将任意长度的消息压缩到某一固定长度的消息摘要的函数。</span><span style="color:rgb(51,51,51);">）</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp; 而当使用哈希表进行查询的时候，就是再次使用哈希函数将key转换为对应的数组下标，并定位到该空间获取value，如此一来，就可以充分利用到数组的定位性能进行数据定位</span><span style="color:rgb(51,51,51);">。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(46,46,46);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">数组的特点是：寻址容易，插入和删除困难；</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(46,46,46);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">而链表的特点是：寻址困难，插入和删除容易。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(46,46,46);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">那么我们能不能综合两者的特性，做出一种寻址容易，插入删除也容易的数据结构？答案是肯定的，这就是我们要提起的哈希表，哈希表有多种不同的实现方法，我接下来解释的是最常用的一种方法——拉链法，我们可以理解为“链表的数组”，如图：</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(46,46,46);"><img src="https://img-blog.csdn.net/20160603152626346?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt=""><br></span><span style="color:rgb(46,46,46);">左边很明显是个数组，数组的每个成员包括一个指针，指向一个链表的头，当然这个链表可能为空，也可能元素很多。我们</span><span style="color:rgb(255,0,0);">根据元素的一些特征把元素分配到不同的链表中去，也是根据这些特征，找到正确的链表，再从链表中找出这个元素。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(255,0,0);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">&nbsp;</span><span style="color:rgb(51,51,51);">Hash的应用</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">1、</span><span style="color:rgb(51,51,51);">H</span><span style="color:rgb(51,51,51);">ash</span><span style="color:rgb(51,51,51);">主要用于信息安全领域中加密算法，它把一些不同长度的信息转化成杂乱的128位的编码,这些编码值叫做H</span><span style="color:rgb(51,51,51);">ash</span><span style="color:rgb(51,51,51);">值. 也可以说，H</span><span style="color:rgb(51,51,51);">ash</span><span style="color:rgb(51,51,51);">就是找到一种数据内容和数据存放地址之间的映射关系。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">2、查找：</span><span style="color:rgb(51,51,51);">哈希表，又称为散列，是一种更加快捷的查找技术。我们之前的查找，都是这样一种思路：集合中拿出来一个元素，看看是否与我们要找的相等，如果不等，缩小范围，继续查找。而哈希表是完全另外一种思路：当我知道key值以后，我就可以直接计算出这个元素在集合中的位置，根本不需要一次又一次的查找！</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">举一个例子，假如我的数组A中，第i个元素里面装的key就是i，那么数字3肯定是在第3个位置，数字10肯定是在第10个位置。哈希表就是利用利用这种基本的思想，建立一个从key到位置的函数，然后进行直接计算查找。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">3、</span><span style="color:rgb(0,0,255);">H</span><span style="color:rgb(0,0,255);">ash表在海量数据处理中有着广泛应用。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(46,46,46);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">Hash Table的查询速度非常的快，几乎是O(1)的时间复杂度。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(255,0,0);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">hash就是找到一种数据内容和数据存放地址之间的映射关系。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(46,46,46);">散列法</span><span style="color:rgb(46,46,46);">：</span><span style="color:rgb(46,46,46);">元素特征转变为数组下标的方法</span><span style="color:rgb(46,46,46);">。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(46,46,46);">我想大家都在想一个很严重的问题：“如果两个字符串在哈希表中对应的位置相同怎么办？”,毕竟一个数组容量是有限的，这种可能性很大。解决该问题的方法很多，我首先想到的就是用“</span><span style="color:rgb(46,46,46);">链表</span><span style="color:rgb(46,46,46);">”</span><span style="color:rgb(46,46,46);">。</span><span style="color:rgb(46,46,46);">我遇到的很多算法都可以转化成链表来解决，只要在哈希表的每个入口挂一个链表，保存所有对应的字符串就OK了。</span></span></span></p><h2 style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><a name="t0"></a><a name="t0" target="_blank"></a><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;">散列表的查找步骤&nbsp;</span></span></h2><h2 style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><a name="t1"></a><a name="t1" target="_blank"></a><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;">当存储记录时，通过散列函数计算出记录的散列地址</span></span></h2><h2 style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><a name="t2"></a><a name="t2" target="_blank"></a><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;">当查找记录时，我们通过同样的是散列函数计算记录的散列地址，并按此散列地址访问该记录</span></span></h2><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">关键字——散列函数（哈希函数）——散列地址</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">优点：一对一的查找效率很高；</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">缺点：一个关键字可能对应多个散列地址；需要查找一个范围时，效果不好。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">散列冲突：不同的关键字经过散列函数的计算得到了相同的散列地址。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">好的散列函数=计算简单+分布均匀（计算得到的散列地址分布均匀）</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">哈希表是种数据结构，它可以提供快速的插入操作和查找操作。</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">优缺点</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(0,0,255);">优点：</span>不论哈希表中有多少数据，查找、插入、删除（有时包括删除）只需要接近常量的时间即0(1）的时间级。实际上，这只需要几条机器指令。</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">哈希表运算得非常快，在计算机程序中，如果需要在一秒种内查找上千条记录通常使用哈希表（例如拼写检查器)哈希表的速度明显比树快，树的操作通常需要O(N)的时间级。哈希表不仅速度快，编程实现也相对容易。</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">如果不需要有序遍历数据，并且可以提前预测数据量的大小。那么哈希表在速度和易用性方面是<a href="https://www.baidu.com/s?wd=%E6%97%A0%E4%B8%8E%E4%BC%A6%E6%AF%94&amp;tn=24004469_oem_dg&amp;rsv_dl=gh_pl_sl_csd" target="_blank">无与伦比</a>的。</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(0,0,255);">缺点：</span>它是<span style="color:rgb(255,0,0);">基于数组</span>的，数组创建后难于扩展，某些哈希表被基本填满时，性能下降得非常严重，所以程序员<span style="color:rgb(255,0,0);">必须要清楚表中将要存储多少数据</span>（或者准备好定期地把数据转移到更大的哈希表中，这是个费时的过程）。</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;&nbsp;&nbsp; 元素特征转变为数组下标的方法就是散列法。散列法当然不止一种，下面列出三种比较常用的：</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">1，除法散列法</span><span style="color:rgb(51,51,51);">&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">最直观的一种，上图使用的就是这种散列法，公式：&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; index = value % 16&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">学过汇编的都知道，求模数其实是通过一个除法运算得到的，所以叫“除法散列法”。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">2，平方散列法</span><span style="color:rgb(51,51,51);">&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">求index是非常频繁的操作，而乘法的运算要比除法来得省时（对现在的CPU来说，估计我们感觉不出来），所以我们考虑把除法换成乘法和一个位移操作。公式：&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; index = (value * value) &gt;&gt; 28&nbsp;&nbsp;&nbsp;</span><span style="color:rgb(51,51,51);">（</span><span style="color:rgb(51,51,51);">右移，除以2^28。记法：左移变大，是乘。右移变小，是除。</span><span style="color:rgb(51,51,51);">）</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">如果数值分配比较均匀的话这种方法能得到不错的结果，但我上面画的那个图的各个元素的值算出来的index都是0——非常失败。也许你还有个问题，value如果很大，value * value不会溢出吗？答案是会的，但我们这个乘法不关心溢出，因为我们根本不是为了获取相乘结果，而是为了获取index。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">3，斐波那契（Fibonacci）散列法</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">平方散列法的缺点是<a href="https://www.baidu.com/s?wd=%E6%98%BE%E8%80%8C%E6%98%93%E8%A7%81&amp;tn=24004469_oem_dg&amp;rsv_dl=gh_pl_sl_csd" target="_blank">显而易见</a>的，所以我们能不能找出一个理想的乘数，而不是拿value本身当作乘数呢？答案是肯定的。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">1，对于16位整数而言，这个乘数是40503&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">2，对于32位整数而言，这个乘数是2654435769&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">3，对于64位整数而言，这个乘数是11400714819323198485</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp; 这几个“理想乘数”是如何得出来的呢？这跟一个法则有关，叫黄金分割法则，而描述黄金分割法则的最经典表达式无疑就是著名的斐波那契数列，即如此形式的序列：</span><span style="color:rgb(6,69,173);">0</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">1</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">1</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">2</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">3</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">5</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">8</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">13</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">21</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">34</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">55</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">89</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">144</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">233</span><span style="color:rgb(51,51,51);">,</span><span style="color:rgb(186,0,0);">377</span><span style="color:rgb(51,51,51);">,&nbsp;</span><span style="color:rgb(6,69,173);">610</span><span style="color:rgb(51,51,51);">， 987, 1597, 2584, 4181, 6765, 10946，…。另外，斐波那契数列的值和太阳系<a href="https://www.baidu.com/s?wd=%E5%85%AB%E5%A4%A7%E8%A1%8C%E6%98%9F&amp;tn=24004469_oem_dg&amp;rsv_dl=gh_pl_sl_csd" target="_blank">八大行星</a>的轨道半径的比例出奇吻合。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp; 对我们常见的32位整数而言，公式：&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; index = (value * 2654435769) &gt;&gt; 28</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;&nbsp;&nbsp; 如果用这种斐波那契散列法的话，那上面的图就变成这样了：</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);"><img src="https://img-blog.csdn.net/20160603152646248?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt=""><br></span><span style="color:rgb(51,51,51);">注：用斐波那契散列法调整之后会比原来的取摸散列法好很多。&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">适用范围</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp; 快速查找，删除的基本数据结构，通常需要总数据量可以放入内存。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">基本原理及要点</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp; hash函数选择，针对字符串，整数，排列，具体相应的hash方法。&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">碰撞处理，一种是open hashing，也称为拉链法；另一种就是closed hashing，也称开地址法，opened addressing。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">散列冲突的解决方案：</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">1.建立一个缓冲区，把凡是拼音重复的人放到缓冲区中。当我通过名字查找人时，</span><span style="color:rgb(51,51,51);">发现</span><span style="color:rgb(51,51,51);">找的不对，就在缓冲区里找。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">2.进行再探测。就是在其他地方查找。探测的方法也可以有很多种。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">（1）在找到查找位置的index的index-1，index+1位置查找，index-2，index+2查找，依次类推。这种方法称为线性再探测。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">（2）在查找位置index周围随机的查找。称为随机在探测。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">（3）再哈希。就是当冲突时，采用另外一种映射方式来查找。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">这个程序中是通过</span><span style="color:rgb(0,0,255);">取模</span><span style="color:rgb(51,51,51);">来模拟查找到重复元素的过程。对待重复元素的方法就是再哈希：对当前key的位置+7。最后，可以通过全局变量来判断需要查找多少次。我这里通过依次查找26个英文字母的小写计算的出了总的查找次数。显然，当总的查找次数/查找的总元素数越接近1时，哈希表更接近于一一映射的函数，查找的效率更高。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">扩展&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp; d-left hashing中的d是多个的意思，我们先简化这个问题，看一看2-left hashing。2-left hashing指的是将一个哈希表分成长度相等的两半，分别叫做T1和T2，给T1和T2分别配备一个哈希函数，h1和h2。在存储一个新的key时，同 时用两个哈希函数进行计算，得出两个地址h1[key]和h2[key]。这时需要检查T1中的h1[key]位置和T2中的h2[key]位置，哪一个 位置已经存储的（有碰撞的）key比较多，然后将新key存储在负载少的位置。如果两边一样多，比如两个位置都为空或者都存储了一个key，就把新key 存储在左边的T1子表中，2-left也由此而来。在查找一个key时，必须进行两次hash，同时查找两个位置。</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="color:rgb(51,51,51);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;">&nbsp;</span></span></span></p><p style="font-family:'-apple-system', 'SF UI Text', Arial, 'PingFang SC', 'Hiragino Sans GB', 'Microsoft YaHei', 'WenQuanYi Micro Hei', sans-serif, SimHei, SimSun;background-color:rgb(255,255,255);"><span style="font-family:'KaiTi_GB2312';font-size:18px;"><span style="font-weight:700;"><span style="color:rgb(51,51,51);">问题实例（海量数据处理）</span><span style="color:rgb(51,51,51);">&nbsp;</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">&nbsp;&nbsp;&nbsp; 我们知道hash 表在海量数据处理中有着广泛的应用，下面，请看另一道百度面试题：</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">题目：海量日志数据，提取出某日访问百度次数最多的那个IP。</span><span style="color:rgb(51,51,51);"><br></span><span style="color:rgb(51,51,51);">方案：IP的数目还是有限的，最多2^32个，所以可以考虑使用hash将ip直接存入内存，然后进行统计。</span></span></span></p>            </div>
            </div>
QQ倾
关注
2
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
哈希表（散列表）原理详解

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/yyyljw/article/details/80903391 &lt;/div&gt; &lt;link rel="stylesheet" href="https://csdnimg.cn/release/phoenix...
复制链接

扫一扫