-
哈希算法,是一类算法;
-
哈希表(Hash Table)是一种数据结构;
-
哈希函数,是支撑哈希表的一类函数;
-
Map
是映射、地图的意思,在Java中Map
表示一种把K
映射到V
的数据类型; -
HashMap
是Java中用哈希数据结构实现的Map
;
HashMap如何实现数组索引的查找?
主要这两个函数 1. static final int hash(Object key) { int h; return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16); } 2. tab[(n - 1) & hash] 解析: 获取key的散列表,即hash值,显然hash值是int类型,最高32位。如果仅仅通过hash值定位数组的索引,将有10亿的范围。这个范围太大,以至于内存根本放不下。所以必须对它进行处理。 (n - 1) & hash 通过这个表达式就可以处理。数组的长度是2的n次方,这样的好处是(n-1)的二进制表达式变为...000...000111...111,最后几位都是1,这样和hash进行与操作时只会保留hash值最后面几位二进制位,大小在0-(n-1),这刚好就是数组的索引。 这时有同学就会奇怪了,这样不挺好的吗?为啥还有(h = key.hashCode()) ^ (h >>> 16)这个操作? 先说明一下这个操作,把hashCode的低16位和高16位进行异或处理,得到新的hashCode。至于为什么做,百度了解了下,说这是个扰动策略,可以大大降低hashCode的碰撞,所谓碰撞,就是尽量减少索引落在同一个位置,使其均匀分布,那样就可以避免或减少链表的遍历了
一、Hash算法
1. 是什么?
-
查词典
先来看英语翻译:hash 英 [hæʃ] 美 [hæʃ] n. 剁碎的食物;混杂,拼凑;重新表述 vt. 搞糟,把…弄乱;切碎;推敲 n. (Hash)人名;(阿拉伯、保、英)哈什;(西)阿什
- 1
- 2
- 3
- 4
- 5
我觉得 切碎 最适合,但正式上会被称为“散列 ”。有时候也叫“哈希 ”,据说是因为最早翻译的人以为这是某个叫Hash的人发明的算法,所以音译了其名字;
(下面我可能会根据情况混合使用这些词,所以要记得他们是同义词)
-
所以
Hash算法 是这样一类算法:这类算法接受任意长度的二进制输入值,对输入值做换算(切碎),最终给出固定长度的二进制输出值;
所以注意:Hash算法 不是某个固定的算法,它代表的是一类算法。
以更好理解的方式来说,Hash算法 是摘要算法 :也就是说,从不同的输入中,通过一些计算摘取出来一段输出数据,值可以用以区分输入数据。
所以,MD5 可能是最著名的一种Hash算法 了。
2. 有什么用?
那么,具体来说Hash/摘要/散列/切碎算法 有哪些用处呢?
-
信息安全领域:
Hash算法 可用作加密算法。
如文件校验:通过对文件摘要,可以得到文件的“数字指纹”,你下载的任何副本的“数字指纹”只要和官方给出的“数字指纹”一致,那么就可以知道这是未经篡改的。例如著名的MD5; -
数据结构领域:
Hash算法 通常还可用作快速查找。
这是今天我想说的部分。根据Hash函数 我们可以实现一种叫做哈希表(Hash Table)的数据结构。这种结构可以实现对数据进行快速的存取。
接下来我们就来看看Hash算法 的一个重要的应用领域:数据结构 - 哈希表;
二、哈希表
1. 什么是哈希表
首先想一个问题:我们是如何在数据结构中做查找的呢?
-
线性表、树
线性表、树 这些结构中,记录 在结构 中的相对位置是随机的,和记录的关键字之间不存在确定关系,因此,在结构中查找时需要进行一系列和关键字的比较。这一类查找方法建立在“比较”的基础上。在顺序查找时,比较的结果为“=”与“≠”2种可能;在折半查找、二叉排序树查找和B-树查找时,比较的结果为“<”“=”“>”3种可能。查找的效率依赖于查找过程中所进行的比较次数。
-
哈希表
理想的情况是希望不经过任何比较,一次存取便能得到所查记录,那就必须在记录的存储位置和它的关键字之间建立一个确定的关系<nobr><span class="math" id="MathJax-Span-1" style="width:0.703em; display:inline-block"><span style="display:inline-block; position:relative; width:0.55em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-2"><span class="mi" id="MathJax-Span-3" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.262em; vertical-align:-0.319em"></span></span></nobr>,使每个关键字和结构中一个唯一的存储位置相对应。因而在查找时,只要根据这个对应关系<nobr><span class="math" id="MathJax-Span-4" style="width:0.703em; display:inline-block"><span style="display:inline-block; position:relative; width:0.55em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-5"><span class="mi" id="MathJax-Span-6" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.262em; vertical-align:-0.319em"></span></span></nobr>找到给定值<nobr><span class="math" id="MathJax-Span-7" style="width:1.141em; display:inline-block"><span style="display:inline-block; position:relative; width:0.9em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-8"><span class="mi" id="MathJax-Span-9" style="font-family:MathJax_Math; font-style:italic">K<span style="display:inline-block; overflow:hidden; height:1px; width:0.04em"></span></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:0.979em; vertical-align:-0.063em"></span></span></nobr>的像<nobr><span class="math" id="MathJax-Span-10" style="width:2.766em; display:inline-block"><span style="display:inline-block; position:relative; width:2.2em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-11"><span class="mi" id="MathJax-Span-12" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span><span class="mo" id="MathJax-Span-13" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-14" style="font-family:MathJax_Math; font-style:italic">K<span style="display:inline-block; overflow:hidden; height:1px; width:0.04em"></span></span><span class="mo" id="MathJax-Span-15" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>。若结构中存在关键字和<nobr><span class="math" id="MathJax-Span-16" style="width:1.141em; display:inline-block"><span style="display:inline-block; position:relative; width:0.9em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-17"><span class="mi" id="MathJax-Span-18" style="font-family:MathJax_Math; font-style:italic">K<span style="display:inline-block; overflow:hidden; height:1px; width:0.04em"></span></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:0.979em; vertical-align:-0.063em"></span></span></nobr>相等的记录,则必定在<nobr><span class="math" id="MathJax-Span-19" style="width:2.766em; display:inline-block"><span style="display:inline-block; position:relative; width:2.2em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-20"><span class="mi" id="MathJax-Span-21" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span><span class="mo" id="MathJax-Span-22" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-23" style="font-family:MathJax_Math; font-style:italic">K<span style="display:inline-block; overflow:hidden; height:1px; width:0.04em"></span></span><span class="mo" id="MathJax-Span-24" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>的存储位置上,反之在这个位置上没有记录。由此,不需要比较便可直接取得所查记录。在此,我们称这个对应关系<nobr><span class="math" id="MathJax-Span-25" style="width:0.703em; display:inline-block"><span style="display:inline-block; position:relative; width:0.55em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-26"><span class="mi" id="MathJax-Span-27" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.262em; vertical-align:-0.319em"></span></span></nobr>为哈希(Hash)函数,按这个思想建立的表为哈希表 。
(插播:注意“理想情况”这几个字~~ 这会在后文给出解释)
这是《数据结构(C语言版)》[1]中引出哈希表的一段描述,通俗易懂。所以,我们知道了什么是哈希函数 和哈希表 。
-
哈希函数
-
灵活
哈希函数是一个映像,因此哈希函数的设定很灵活,只要使得任何关键字由此所得的哈希函数值都落在表长允许的范围之内即可。 -
冲突
对不同的关键字可能得到同一哈希地址,即<nobr><span class="math" id="MathJax-Span-28" style="width:6.641em; display:inline-block"><span style="display:inline-block; position:relative; width:5.3em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-29"><span class="mi" id="MathJax-Span-30" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-31" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-32" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mn" id="MathJax-Span-33" style="font-family:MathJax_Main">1</span><span class="mo" id="MathJax-Span-34" style="font-family:MathJax_Main; padding-left:0.278em">≠</span><span class="mi" id="MathJax-Span-35" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">k</span><span class="mi" id="MathJax-Span-36" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-37" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mn" id="MathJax-Span-38" style="font-family:MathJax_Main">2</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.289em; vertical-align:-0.331em"></span></span></nobr>,而<nobr><span class="math" id="MathJax-Span-39" style="width:9.953em; display:inline-block"><span style="display:inline-block; position:relative; width:7.95em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-40"><span class="mi" id="MathJax-Span-41" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span><span class="mo" id="MathJax-Span-42" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-43" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-44" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-45" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mn" id="MathJax-Span-46" style="font-family:MathJax_Main">1</span><span class="mo" id="MathJax-Span-47" style="font-family:MathJax_Main">)</span><span class="mo" id="MathJax-Span-48" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mi" id="MathJax-Span-49" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span><span class="mo" id="MathJax-Span-50" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-51" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-52" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-53" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mn" id="MathJax-Span-54" style="font-family:MathJax_Main">2</span><span class="mo" id="MathJax-Span-55" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr> ,这种现象称为冲突(collision);冲突只能尽量地少,而不能完全避免。因为,哈希函数是从关键字集合到地址集合的映像。而通常关键字集合比较大,它的元素包括所有可能的关键字,而地址集合的元素仅为哈希表中的地址值。因此,在实现哈希表这种数据结构的时候不仅要设定一个“好”的哈希函数,而且要设定一种处理冲突的方法。
-
综上所述,我们可以给出哈希表的定义如下:
根据设定的Hash函数 - <nobr><span class="math" id="MathJax-Span-56" style="width:3.953em; display:inline-block"><span style="display:inline-block; position:relative; width:3.15em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-57"><span class="mi" id="MathJax-Span-58" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span class="mo" id="MathJax-Span-59" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-60" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-61" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-62" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mo" id="MathJax-Span-63" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>和处理冲突的方法,将一组关键字映象到一个有限的连续的地址集(区间)上,并以关键字在地址集中的象 作为记录在表中的存储位置,这样的表便称为Hash表;
2. 哈希函数
上面我们已经引出了并解释了Hash函数 。实际工作中,需要视不同的情况采用不同的Hash函数 ,通常要考虑的因素有:
- Hash函数 执行的时间;
- 关键字 的长度;
- Hash表 的大小;
- 关键字 的分布情况;
- 记录 的查找频率;
有如下一些常用的Hash函数 构造方法:
-
直接寻址法:
<nobr><span class="math" id="MathJax-Span-64" style="width:4.641em; display:inline-block"><span style="display:inline-block; position:relative; width:3.7em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-65"><span class="mi" id="MathJax-Span-66" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span><span class="mo" id="MathJax-Span-67" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-68" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mo" id="MathJax-Span-69" style="font-family:MathJax_Main">)</span><span class="mo" id="MathJax-Span-70" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mi" id="MathJax-Span-71" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">k</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr> 或者<nobr><span class="math" id="MathJax-Span-72" style="width:8.578em; display:inline-block"><span style="display:inline-block; position:relative; width:6.85em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-73"><span class="mi" id="MathJax-Span-74" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span><span class="mo" id="MathJax-Span-75" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-76" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mo" id="MathJax-Span-77" style="font-family:MathJax_Main">)</span><span class="mo" id="MathJax-Span-78" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mi" id="MathJax-Span-79" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">a</span><span class="mo" id="MathJax-Span-80" style="font-family:MathJax_Main; padding-left:0.222em">∗</span><span class="mi" id="MathJax-Span-81" style="font-family:MathJax_Math; font-style:italic; padding-left:0.222em">k</span><span class="mo" id="MathJax-Span-82" style="font-family:MathJax_Main; padding-left:0.222em">+</span><span class="mi" id="MathJax-Span-83" style="font-family:MathJax_Math; font-style:italic; padding-left:0.222em">b</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>
取k 或k 的某个线性函数为Hash地址 。
特点:由于直接地址法相当于有多少个关键字就必须有多少个相应地址去对应,所以不会产生冲突,也正因为此,所以实际中很少使用这种构造方法。
-
数字分析法:
首先分析待存的一组关键字 ,比如是一个班级学生的出生年月日 ,我们发现他们的出生年 大体相同,那么我们肯定不能用他们的年来作为存储地址 ,这样出现冲突 的几率很大;但是,我们发现月日 的具体数字差别很大,如果我们用月日来作为Hash地址 ,则会明显降低冲突几率。因此,数字分析法就是找出关键字 的规律,尽可能用差异数据来构造Hash地址;
特点:需要提前知道所有可能的关键字,才能分析运用此种方法,所以不太常用。
-
平方取中法:
先求出关键字的平方值,然后按需要取平方值的中间几位作为哈希地址。这是因为:平方后中间几位和关键字中每一位都相关,故不同关键字会以较高的概率产生不同的哈希地址。
例:我们把英文字母在字母表中的位置序号作为该英文字母的内部编码。例如K的内部编码为11,E的内部编码为05,Y的内部编码为25,A的内部编码为01, B的内部编码为02。由此组成关键字“KEYA”的内部代码为11052501,同理我们可以得到关键字“KYAB”、“AKEY”、“BKEY”的内部编码。之后对关键字进行平方运算后,取出第7到第9位作为该关键字哈希地址,如下图所示:
关键字 内部编码 内部编码的平方值 H(k)关键字的哈希地址 KEYA 11050201 122157778355001 778 KYAB 11250102 126564795010404 795 AKEY 01110525 001233265775625 265 BKEY 02110525 004454315775625 315 [2]
特点:较常用。
-
折叠法:
将关键字分割成位数相同的几部分(最后一部分位数可以不同),然后取这几部分的叠加和(去除进位)作为散列地址。数位叠加可以有移位叠加和间界叠加两种方法。移位叠加是将分割后的每一部分的最低位对齐,然后相加;间界叠加是从一端向另一端沿分割界来回折叠,然后对齐相加。
-
随机数法:
选择一个随机函数,取关键字的随机函数值作为Hash地址 ,通常用于关键字长度不同的场合。即
<nobr><span class="math" id="MathJax-Span-84" style="width:12.328em; display:inline-block"><span style="display:inline-block; position:relative; width:9.85em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-85"><span class="mi" id="MathJax-Span-86" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span><span class="mo" id="MathJax-Span-87" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-88" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-89" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-90" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mo" id="MathJax-Span-91" style="font-family:MathJax_Main">)</span><span class="mo" id="MathJax-Span-92" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mi" id="MathJax-Span-93" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">r</span><span class="mi" id="MathJax-Span-94" style="font-family:MathJax_Math; font-style:italic">a</span><span class="mi" id="MathJax-Span-95" style="font-family:MathJax_Math; font-style:italic">n</span><span class="mi" id="MathJax-Span-96" style="font-family:MathJax_Math; font-style:italic">d<span style="display:inline-block; overflow:hidden; height:1px; width:0.003em"></span></span><span class="mi" id="MathJax-Span-97" style="font-family:MathJax_Math; font-style:italic">o</span><span class="mi" id="MathJax-Span-98" style="font-family:MathJax_Math; font-style:italic">m</span><span class="mo" id="MathJax-Span-99" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-100" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-101" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-102" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mo" id="MathJax-Span-103" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>特点:通常,关键字长度不相等时,采用此法构建Hash函数 较为合适。
-
除留取余法:
<nobr><span class="math" id="MathJax-Span-104" style="width:4.641em; display:inline-block"><span style="display:inline-block; position:relative; width:3.7em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-105"><span class="mi" id="MathJax-Span-106" style="font-family:MathJax_Math; font-style:italic">f<span style="display:inline-block; overflow:hidden; height:1px; width:0.06em"></span></span><span class="mo" id="MathJax-Span-107" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-108" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mo" id="MathJax-Span-109" style="font-family:MathJax_Main">)</span><span class="mo" id="MathJax-Span-110" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mi" id="MathJax-Span-111" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">k</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr><nobr><span class="math" id="MathJax-Span-112" style="width:2.391em; display:inline-block"><span style="display:inline-block; position:relative; width:1.9em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-113"><span class="mi" id="MathJax-Span-114" style="font-family:MathJax_Math; font-style:italic">m</span><span class="mi" id="MathJax-Span-115" style="font-family:MathJax_Math; font-style:italic">o</span><span class="mi" id="MathJax-Span-116" style="font-family:MathJax_Math; font-style:italic">d<span style="display:inline-block; overflow:hidden; height:1px; width:0.003em"></span></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.006em; vertical-align:-0.076em"></span></span></nobr><nobr><span class="math" id="MathJax-Span-117" style="width:0.641em; display:inline-block"><span style="display:inline-block; position:relative; width:0.5em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-118"><span class="mi" id="MathJax-Span-119" style="font-family:MathJax_Math; font-style:italic">p</span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:0.92em; vertical-align:-0.305em"></span></span></nobr> , <nobr><span class="math" id="MathJax-Span-120" style="width:4.391em; display:inline-block"><span style="display:inline-block; position:relative; width:3.5em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-121"><span class="mi" id="MathJax-Span-122" style="font-family:MathJax_Math; font-style:italic">p</span><span class="mo" id="MathJax-Span-123" style="font-family:MathJax_Main; padding-left:0.278em"><<span style="font-family:MathJax_Main; font-style:normal; font-weight:normal">=</span></span><span class="mi" id="MathJax-Span-124" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">m</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.042em; vertical-align:-0.305em"></span></span></nobr>
取关键字被某个不大于Hash表 长m 的数p 除后所得的余数为Hash地址 。
特点:这是最简单也是最常用的Hash函数构造方法。可以直接取模,也可以在平法法、折叠法之后再取模。
值得注意的是,在使用除留取余法 时,对p 的选择很重要,如果p 选的不好会容易产生同义词 。由经验得知:p 最好选择不大于表长m 的一个质数 、或者不包含小于20的质因数的合数。
3. 处理冲突
如何处理冲突是哈希造表不可缺少的一个方面。现在完整的描述一下处理冲突:
假设哈希表的地址集为<nobr><span class="math" id="MathJax-Span-125" style="width:4.828em; display:inline-block"><span style="display:inline-block; position:relative; width:3.85em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-126"><span class="mn" id="MathJax-Span-127" style="font-family:MathJax_Main">0</span><span class="mtext" id="MathJax-Span-128" style="font-family:MathJax_Main"></span><span class="mo" id="MathJax-Span-129" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-130" style="font-family:MathJax_Math; font-style:italic">n</span><span class="mo" id="MathJax-Span-131" style="font-family:MathJax_Main; padding-left:0.222em">−</span><span class="mn" id="MathJax-Span-132" style="font-family:MathJax_Main; padding-left:0.222em">1</span><span class="mo" id="MathJax-Span-133" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>,冲突是指由关键字得到的哈希地址为<nobr><span class="math" id="MathJax-Span-134" style="width:8.891em; display:inline-block"><span style="display:inline-block; position:relative; width:7.1em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-135"><span class="mi" id="MathJax-Span-136" style="font-family:MathJax_Math; font-style:italic">j</span><span class="mo" id="MathJax-Span-137" style="font-family:MathJax_Main">(</span><span class="mn" id="MathJax-Span-138" style="font-family:MathJax_Main">0</span><span class="mo" id="MathJax-Span-139" style="font-family:MathJax_Main; padding-left:0.278em">≤</span><span class="mi" id="MathJax-Span-140" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">j</span><span class="mo" id="MathJax-Span-141" style="font-family:MathJax_Main; padding-left:0.278em">≤</span><span class="mi" id="MathJax-Span-142" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">n</span><span class="mo" id="MathJax-Span-143" style="font-family:MathJax_Main; padding-left:0.222em">−</span><span class="mn" id="MathJax-Span-144" style="font-family:MathJax_Main; padding-left:0.222em">1</span><span class="mo" id="MathJax-Span-145" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>的位置上已存有记录,则“处理冲突”就是为该关键字的记录找到另一个“空”的哈希地址。
在处理冲突的过程中可能得到一个地址序列<nobr><span class="math" id="MathJax-Span-146" style="width:18.141em; display:inline-block"><span style="display:inline-block; position:relative; width:14.5em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-147"><span class="msubsup" id="MathJax-Span-148"><span style="display:inline-block; position:relative; width:1.168em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-149" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-150" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-151" style="font-family:MathJax_Main">,</span><span class="mi" id="MathJax-Span-152" style="font-family:MathJax_Math; font-style:italic; padding-left:0.167em">i</span><span class="mo" id="MathJax-Span-153" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mn" id="MathJax-Span-154" style="font-family:MathJax_Main; padding-left:0.278em">1</span><span class="mo" id="MathJax-Span-155" style="font-family:MathJax_Main">,</span><span class="mn" id="MathJax-Span-156" style="font-family:MathJax_Main; padding-left:0.167em">2</span><span class="mo" id="MathJax-Span-157" style="font-family:MathJax_Main">,</span><span class="mo" id="MathJax-Span-158" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-159" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-160" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-161" style="font-family:MathJax_Main; padding-left:0.167em">,</span><span class="mi" id="MathJax-Span-162" style="font-family:MathJax_Math; font-style:italic; padding-left:0.167em">k</span><span class="mo" id="MathJax-Span-163" style="font-family:MathJax_Main">(</span><span class="msubsup" id="MathJax-Span-164"><span style="display:inline-block; position:relative; width:1.168em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-165" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-166" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-167" style="font-family:MathJax_Main; padding-left:0.278em">∈</span><span class="mo" id="MathJax-Span-168" style="font-family:MathJax_Main; padding-left:0.278em">[</span><span class="mn" id="MathJax-Span-169" style="font-family:MathJax_Main">0</span><span class="mo" id="MathJax-Span-170" style="font-family:MathJax_Main">,</span><span class="mi" id="MathJax-Span-171" style="font-family:MathJax_Math; font-style:italic; padding-left:0.167em">n</span><span class="mo" id="MathJax-Span-172" style="font-family:MathJax_Main; padding-left:0.222em">−</span><span class="mn" id="MathJax-Span-173" style="font-family:MathJax_Main; padding-left:0.222em">1</span><span class="mo" id="MathJax-Span-174" style="font-family:MathJax_Main">]</span><span class="mo" id="MathJax-Span-175" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>。即在处理哈希地址的冲突时,若得到的另一个哈希地址<nobr><span class="math" id="MathJax-Span-176" style="width:1.453em; display:inline-block"><span style="display:inline-block; position:relative; width:1.15em; height:0px; font-size:125%"><span style="position:absolute; top:-2.4em; left:0em"><span class="mrow" id="MathJax-Span-177"><span class="msubsup" id="MathJax-Span-178"><span style="display:inline-block; position:relative; width:1.168em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-179" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-180" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.176em; vertical-align:-0.26em"></span></span></nobr>仍然发生冲突,则再求下一个地址<nobr><span class="math" id="MathJax-Span-181" style="width:1.578em; display:inline-block"><span style="display:inline-block; position:relative; width:1.25em; height:0px; font-size:125%"><span style="position:absolute; top:-2.4em; left:0em"><span class="mrow" id="MathJax-Span-182"><span class="msubsup" id="MathJax-Span-183"><span style="display:inline-block; position:relative; width:1.268em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-184" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mn" id="MathJax-Span-185" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.166em; vertical-align:-0.25em"></span></span></nobr>,若<nobr><span class="math" id="MathJax-Span-186" style="width:1.578em; display:inline-block"><span style="display:inline-block; position:relative; width:1.25em; height:0px; font-size:125%"><span style="position:absolute; top:-2.4em; left:0em"><span class="mrow" id="MathJax-Span-187"><span class="msubsup" id="MathJax-Span-188"><span style="display:inline-block; position:relative; width:1.268em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-189" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mn" id="MathJax-Span-190" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.166em; vertical-align:-0.25em"></span></span></nobr>仍然冲突,再求<nobr><span class="math" id="MathJax-Span-191" style="width:1.578em; display:inline-block"><span style="display:inline-block; position:relative; width:1.25em; height:0px; font-size:125%"><span style="position:absolute; top:-2.4em; left:0em"><span class="mrow" id="MathJax-Span-192"><span class="msubsup" id="MathJax-Span-193"><span style="display:inline-block; position:relative; width:1.268em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-194" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mn" id="MathJax-Span-195" style="font-family:MathJax_Main; font-size:70.7%">3</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.186em; vertical-align:-0.269em"></span></span></nobr>,依次类推,直至<nobr><span class="math" id="MathJax-Span-196" style="width:1.578em; display:inline-block"><span style="display:inline-block; position:relative; width:1.25em; height:0px; font-size:125%"><span style="position:absolute; top:-2.4em; left:0em"><span class="mrow" id="MathJax-Span-197"><span class="msubsup" id="MathJax-Span-198"><span style="display:inline-block; position:relative; width:1.268em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-199" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-200" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">k</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.176em; vertical-align:-0.26em"></span></span></nobr>不发生冲突为止,则<nobr><span class="math" id="MathJax-Span-201" style="width:1.578em; display:inline-block"><span style="display:inline-block; position:relative; width:1.25em; height:0px; font-size:125%"><span style="position:absolute; top:-2.4em; left:0em"><span class="mrow" id="MathJax-Span-202"><span class="msubsup" id="MathJax-Span-203"><span style="display:inline-block; position:relative; width:1.268em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-204" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-205" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">k</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.176em; vertical-align:-0.26em"></span></span></nobr>为记录在表中的地址。
(需要注意此定义不太适合链地址法)
那么,通常有以下4种方法:
-
开放定址法:
<nobr><span class="math" id="MathJax-Span-206" style="width:30.641em; display:inline-block"><span style="display:inline-block; position:relative; width:24.5em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-207"><span class="msubsup" id="MathJax-Span-208"><span style="display:inline-block; position:relative; width:1.168em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-209" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-210" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-211" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mo" id="MathJax-Span-212" style="font-family:MathJax_Main; padding-left:0.278em">(</span><span class="mi" id="MathJax-Span-213" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span class="mo" id="MathJax-Span-214" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-215" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-216" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-217" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mo" id="MathJax-Span-218" style="font-family:MathJax_Main">)</span><span class="mo" id="MathJax-Span-219" style="font-family:MathJax_Main; padding-left:0.222em">+</span><span class="msubsup" id="MathJax-Span-220" style="padding-left:0.222em"><span style="display:inline-block; position:relative; width:0.822em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-221" style="font-family:MathJax_Math; font-style:italic">d<span style="display:inline-block; overflow:hidden; height:1px; width:0.003em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.497em"><span class="mi" id="MathJax-Span-222" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-223" style="font-family:MathJax_Main">)</span><span class="TeXmathchoice" id="MathJax-Span-224"><span class="mspace" id="MathJax-Span-225" style="height:0em; vertical-align:0em; width:0.667em; display:inline-block; overflow:hidden"></span></span><span class="mi" id="MathJax-Span-226" style="font-family:MathJax_Main; padding-left:0.167em">mod</span><span class="mspace" id="MathJax-Span-227" style="height:0em; vertical-align:0em; width:0.167em; display:inline-block; overflow:hidden"></span><span class="mspace" id="MathJax-Span-228" style="height:0em; vertical-align:0em; width:0.167em; display:inline-block; overflow:hidden"></span><span class="mi" id="MathJax-Span-229" style="font-family:MathJax_Math; font-style:italic; padding-left:0.167em">m</span><span class="texatom" id="MathJax-Span-230"><span class="mrow" id="MathJax-Span-231"><span class="mo" id="MathJax-Span-232"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>,</span></span></span></span><span class="mi" id="MathJax-Span-233" style="font-family:MathJax_Math; font-style:italic">i</span><span class="mo" id="MathJax-Span-234" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mn" id="MathJax-Span-235" style="font-family:MathJax_Main; padding-left:0.278em">1</span><span class="mo" id="MathJax-Span-236" style="font-family:MathJax_Main">,</span><span class="mn" id="MathJax-Span-237" style="font-family:MathJax_Main; padding-left:0.167em">2</span><span class="mo" id="MathJax-Span-238" style="font-family:MathJax_Main">,</span><span class="mo" id="MathJax-Span-239" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-240" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-241" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-242" style="font-family:MathJax_Main; padding-left:0.167em">,</span><span class="mi" id="MathJax-Span-243" style="font-family:MathJax_Math; font-style:italic; padding-left:0.167em">k</span><span class="mo" id="MathJax-Span-244" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-245" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mo" id="MathJax-Span-246" style="font-family:MathJax_Main; padding-left:0.278em">≤</span><span class="mi" id="MathJax-Span-247" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">m</span><span class="mo" id="MathJax-Span-248" style="font-family:MathJax_Main; padding-left:0.222em">−</span><span class="mn" id="MathJax-Span-249" style="font-family:MathJax_Main; padding-left:0.222em">1</span><span class="mo" id="MathJax-Span-250" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.438em; vertical-align:-0.375em"></span></span></nobr>
<nobr><span class="math" id="MathJax-Span-251" style="width:3.953em; display:inline-block"><span style="display:inline-block; position:relative; width:3.15em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-252"><span class="mi" id="MathJax-Span-253" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span class="mo" id="MathJax-Span-254" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-255" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-256" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-257" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mo" id="MathJax-Span-258" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr> 为哈希函数;<nobr><span class="math" id="MathJax-Span-259" style="width:1.141em; display:inline-block"><span style="display:inline-block; position:relative; width:0.9em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-260"><span class="mi" id="MathJax-Span-261" style="font-family:MathJax_Math; font-style:italic">m</span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:0.691em; vertical-align:-0.076em"></span></span></nobr> 为哈希表表长;
<nobr><span class="math" id="MathJax-Span-262" style="width:1.016em; display:inline-block"><span style="display:inline-block; position:relative; width:0.8em; height:0px; font-size:125%"><span style="position:absolute; top:-2.4em; left:0em"><span class="mrow" id="MathJax-Span-263"><span class="msubsup" id="MathJax-Span-264"><span style="display:inline-block; position:relative; width:0.822em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-265" style="font-family:MathJax_Math; font-style:italic">d<span style="display:inline-block; overflow:hidden; height:1px; width:0.003em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.497em"><span class="mi" id="MathJax-Span-266" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.19em; vertical-align:-0.26em"></span></span></nobr> 为增量序列,有3种取法:- <nobr><span class="math" id="MathJax-Span-267" style="width:11.703em; display:inline-block"><span style="display:inline-block; position:relative; width:9.35em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-268"><span class="msubsup" id="MathJax-Span-269"><span style="display:inline-block; position:relative; width:0.822em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-270" style="font-family:MathJax_Math; font-style:italic">d<span style="display:inline-block; overflow:hidden; height:1px; width:0.003em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.497em"><span class="mi" id="MathJax-Span-271" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-272" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mn" id="MathJax-Span-273" style="font-family:MathJax_Main; padding-left:0.278em">1</span><span class="mo" id="MathJax-Span-274" style="font-family:MathJax_Main">,</span><span class="mn" id="MathJax-Span-275" style="font-family:MathJax_Main; padding-left:0.167em">2</span><span class="mo" id="MathJax-Span-276" style="font-family:MathJax_Main">,</span><span class="mn" id="MathJax-Span-277" style="font-family:MathJax_Main; padding-left:0.167em">3</span><span class="mo" id="MathJax-Span-278" style="font-family:MathJax_Main">,</span><span class="mo" id="MathJax-Span-279" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-280" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-281" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-282" style="font-family:MathJax_Main; padding-left:0.167em">,</span><span class="mi" id="MathJax-Span-283" style="font-family:MathJax_Math; font-style:italic; padding-left:0.167em">m</span><span class="mo" id="MathJax-Span-284" style="font-family:MathJax_Main; padding-left:0.222em">−</span><span class="mn" id="MathJax-Span-285" style="font-family:MathJax_Main; padding-left:0.222em">1</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.235em; vertical-align:-0.305em"></span></span></nobr>,称为线性探测再散列;
- <nobr><span class="math" id="MathJax-Span-286" style="width:23.078em; display:inline-block"><span style="display:inline-block; position:relative; width:18.45em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-287"><span class="msubsup" id="MathJax-Span-288"><span style="display:inline-block; position:relative; width:0.822em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-289" style="font-family:MathJax_Math; font-style:italic">d<span style="display:inline-block; overflow:hidden; height:1px; width:0.003em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.497em"><span class="mi" id="MathJax-Span-290" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-291" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="msubsup" id="MathJax-Span-292" style="padding-left:0.278em"><span style="display:inline-block; position:relative; width:0.925em; height:0px"><span style="position:absolute; top:-2.8em; left:0em"><span class="mn" id="MathJax-Span-293" style="font-family:MathJax_Main">1</span><span style="display:inline-block; width:0px; height:2.8em"></span></span><span style="position:absolute; top:-2.893em; left:0.5em"><span class="mn" id="MathJax-Span-294" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-295" style="font-family:MathJax_Main">,</span><span class="mo" id="MathJax-Span-296" style="font-family:MathJax_Main; padding-left:0.167em">−</span><span class="msubsup" id="MathJax-Span-297"><span style="display:inline-block; position:relative; width:0.925em; height:0px"><span style="position:absolute; top:-2.8em; left:0em"><span class="mn" id="MathJax-Span-298" style="font-family:MathJax_Main">1</span><span style="display:inline-block; width:0px; height:2.8em"></span></span><span style="position:absolute; top:-2.893em; left:0.5em"><span class="mn" id="MathJax-Span-299" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-300" style="font-family:MathJax_Main">,</span><span class="msubsup" id="MathJax-Span-301" style="padding-left:0.167em"><span style="display:inline-block; position:relative; width:0.925em; height:0px"><span style="position:absolute; top:-2.8em; left:0em"><span class="mn" id="MathJax-Span-302" style="font-family:MathJax_Main">2</span><span style="display:inline-block; width:0px; height:2.8em"></span></span><span style="position:absolute; top:-2.893em; left:0.5em"><span class="mn" id="MathJax-Span-303" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-304" style="font-family:MathJax_Main">,</span><span class="mo" id="MathJax-Span-305" style="font-family:MathJax_Main; padding-left:0.167em">−</span><span class="msubsup" id="MathJax-Span-306"><span style="display:inline-block; position:relative; width:0.925em; height:0px"><span style="position:absolute; top:-2.8em; left:0em"><span class="mn" id="MathJax-Span-307" style="font-family:MathJax_Main">2</span><span style="display:inline-block; width:0px; height:2.8em"></span></span><span style="position:absolute; top:-2.893em; left:0.5em"><span class="mn" id="MathJax-Span-308" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-309" style="font-family:MathJax_Main">,</span><span class="msubsup" id="MathJax-Span-310" style="padding-left:0.167em"><span style="display:inline-block; position:relative; width:0.925em; height:0px"><span style="position:absolute; top:-2.8em; left:0em"><span class="mn" id="MathJax-Span-311" style="font-family:MathJax_Main">3</span><span style="display:inline-block; width:0px; height:2.8em"></span></span><span style="position:absolute; top:-2.892em; left:0.5em"><span class="mn" id="MathJax-Span-312" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-313" style="font-family:MathJax_Main">,</span><span class="mo" id="MathJax-Span-314" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-315" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-316" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-317" style="font-family:MathJax_Main; padding-left:0.167em">,</span><span class="mo" id="MathJax-Span-318" style="font-family:MathJax_Main; padding-left:0.167em">±</span><span class="msubsup" id="MathJax-Span-319"><span style="display:inline-block; position:relative; width:0.925em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-320" style="font-family:MathJax_Math; font-style:italic">k</span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.921em; left:0.5em"><span class="mn" id="MathJax-Span-321" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="texatom" id="MathJax-Span-322"><span class="mrow" id="MathJax-Span-323"><span class="mo" id="MathJax-Span-324"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>,</span></span></span></span><span class="mo" id="MathJax-Span-325" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-326" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mo" id="MathJax-Span-327" style="font-family:MathJax_Main; padding-left:0.278em">≤</span><span class="mfrac" id="MathJax-Span-328" style="padding-left:0.278em"><span style="display:inline-block; position:relative; width:0.72em; height:0px; margin-right:0.12em; margin-left:0.12em"><span style="position:absolute; top:-2.912em; left:50%; margin-left:-0.3em"><span class="mi" id="MathJax-Span-329" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">m</span><span style="display:inline-block; width:0px; height:2.5em"></span></span><span style="position:absolute; top:-2.125em; left:50%; margin-left:-0.175em"><span class="mn" id="MathJax-Span-330" style="font-family:MathJax_Main; font-size:70.7%">2</span><span style="display:inline-block; width:0px; height:2.5em"></span></span><span style="position:absolute; top:-1.27em; left:0em"><span style="border-left:0.72em solid; display:inline-block; overflow:hidden; width:0px; height:1.25px; vertical-align:0em"></span><span style="display:inline-block; width:0px; height:1.05em"></span></span></span></span><span class="mo" id="MathJax-Span-331" style="font-family:MathJax_Main">)</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.708em; vertical-align:-0.531em"></span></span></nobr>,称为二次探测再散列;
- <nobr><span class="math" id="MathJax-Span-332" style="width:8.703em; display:inline-block"><span style="display:inline-block; position:relative; width:6.95em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-333"><span class="msubsup" id="MathJax-Span-334"><span style="display:inline-block; position:relative; width:0.822em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-335" style="font-family:MathJax_Math; font-style:italic">d<span style="display:inline-block; overflow:hidden; height:1px; width:0.003em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.497em"><span class="mi" id="MathJax-Span-336" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-337" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="texatom" id="MathJax-Span-338" style="padding-left:0.278em"><span class="mrow" id="MathJax-Span-339"><span class="mo" id="MathJax-Span-340"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>伪</span></span></span></span><span class="texatom" id="MathJax-Span-341"><span class="mrow" id="MathJax-Span-342"><span class="mo" id="MathJax-Span-343"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>随</span></span></span></span><span class="texatom" id="MathJax-Span-344"><span class="mrow" id="MathJax-Span-345"><span class="mo" id="MathJax-Span-346"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>机</span></span></span></span><span class="texatom" id="MathJax-Span-347"><span class="mrow" id="MathJax-Span-348"><span class="mo" id="MathJax-Span-349"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>数</span></span></span></span><span class="texatom" id="MathJax-Span-350"><span class="mrow" id="MathJax-Span-351"><span class="mo" id="MathJax-Span-352"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>序</span></span></span></span><span class="texatom" id="MathJax-Span-353"><span class="mrow" id="MathJax-Span-354"><span class="mo" id="MathJax-Span-355"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>列</span></span></span></span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.313em"></span></span></nobr>,称为伪随机探测再散列;
-
再哈希法:
<nobr><span class="math" id="MathJax-Span-356" style="width:16.266em; display:inline-block"><span style="display:inline-block; position:relative; width:13em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-357"><span class="msubsup" id="MathJax-Span-358"><span style="display:inline-block; position:relative; width:1.168em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-359" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-360" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-361" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mi" id="MathJax-Span-362" style="font-family:MathJax_Math; font-style:italic; padding-left:0.278em">R</span><span class="msubsup" id="MathJax-Span-363"><span style="display:inline-block; position:relative; width:1.168em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-364" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-365" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span><span class="mo" id="MathJax-Span-366" style="font-family:MathJax_Main">(</span><span class="mi" id="MathJax-Span-367" style="font-family:MathJax_Math; font-style:italic">k</span><span class="mi" id="MathJax-Span-368" style="font-family:MathJax_Math; font-style:italic">e</span><span class="mi" id="MathJax-Span-369" style="font-family:MathJax_Math; font-style:italic">y<span style="display:inline-block; overflow:hidden; height:1px; width:0.006em"></span></span><span class="mo" id="MathJax-Span-370" style="font-family:MathJax_Main">)</span><span class="mo" id="MathJax-Span-371" style="font-family:MathJax_Main">,</span><span class="mi" id="MathJax-Span-372" style="font-family:MathJax_Math; font-style:italic; padding-left:0.167em">i</span><span class="mo" id="MathJax-Span-373" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mn" id="MathJax-Span-374" style="font-family:MathJax_Main; padding-left:0.278em">1</span><span class="mo" id="MathJax-Span-375" style="font-family:MathJax_Main">,</span><span class="mn" id="MathJax-Span-376" style="font-family:MathJax_Main; padding-left:0.167em">2</span><span class="mo" id="MathJax-Span-377" style="font-family:MathJax_Main">,</span><span class="mo" id="MathJax-Span-378" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-379" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-380" style="font-family:MathJax_Main; padding-left:0.167em">.</span><span class="mo" id="MathJax-Span-381" style="font-family:MathJax_Main; padding-left:0.167em">,</span><span class="mi" id="MathJax-Span-382" style="font-family:MathJax_Math; font-style:italic; padding-left:0.167em">k</span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.375em; vertical-align:-0.375em"></span></span></nobr>
<nobr><span class="math" id="MathJax-Span-383" style="width:2.453em; display:inline-block"><span style="display:inline-block; position:relative; width:1.95em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-384"><span class="mi" id="MathJax-Span-385" style="font-family:MathJax_Math; font-style:italic">R</span><span class="msubsup" id="MathJax-Span-386"><span style="display:inline-block; position:relative; width:1.168em; height:0px"><span style="position:absolute; top:-2.65em; left:0em"><span class="mi" id="MathJax-Span-387" style="font-family:MathJax_Math; font-style:italic">H<span style="display:inline-block; overflow:hidden; height:1px; width:0.057em"></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span><span style="position:absolute; top:-2.35em; left:0.843em"><span class="mi" id="MathJax-Span-388" style="font-family:MathJax_Math; font-size:70.7%; font-style:italic">i</span><span style="display:inline-block; width:0px; height:2.5em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:1.176em; vertical-align:-0.26em"></span></span></nobr> 均是不同的哈希函数,即在同义词产生地址冲突时计算另一个哈希函数地址,直到冲突不再发生,这种方法不易产生聚集 ,但增加了计算时间;
-
链地址法:
将所有关键字为同义词的记录存储在同一线性表中。即在Hash 出来的哈希地址中不直接存Key ,而是存储一个Key的链表 ,当发生冲突 时,将同义的Key 加入链表 ;
-
公共溢出区:
可以建立一个公共溢出区,用来存放有冲突的Key 。比如设立另一个哈希表,专门用来存放出现冲突的同义词。
4. 查找及分析
在哈希表上进行查找的过程和哈希造表的过程基本是一致的,过程就不累述了。我们需要看一看其查找的长度。
-
平均查找长度
-
虽然哈希表在关键字与记录的存储位置之间建立了直接映像,但由于“冲突”的存在,使得哈希表的查找过程仍然是一个“给定值和关键字进行比较”的过程。因此,仍需以平均查找长度作为衡量哈希表的查找效率的量度;
(还记得上面我们说的“理想情况下”吗?~~ 现实告诉我们,一般情况下,还是不得不需要“比较”!)
-
查找过程中需要和给定值进行比较的关键字的个数取决于下列三个因素:
- 哈希函数;
- 处理冲突的方法;
- 哈希表的装填因子;
-
-
装填因子
在一般情况下,我们设计的哈希函数肯定是尽量均匀的,所以可以不考虑它对平均查找长度的影响。那么,处理冲突方法相同的哈希表,其平均查找长度就依赖于哈希表的装填因子了。其定义如下:
<nobr><span class="math" id="MathJax-Span-389" style="width:8.578em; display:inline-block"><span style="display:inline-block; position:relative; width:6.85em; height:0px; font-size:125%"><span style="position:absolute; top:-2.8em; left:0em"><span class="mrow" id="MathJax-Span-390"><span class="mi" id="MathJax-Span-391" style="font-family:MathJax_Math; font-style:italic">α</span><span class="mo" id="MathJax-Span-392" style="font-family:MathJax_Main; padding-left:0.278em">=</span><span class="mfrac" id="MathJax-Span-393" style="padding-left:0.278em"><span style="display:inline-block; position:relative; width:4.62em; height:0px; margin-right:0.12em; margin-left:0.12em"><span style="position:absolute; top:-2.945em; left:50%; margin-left:-2.25em"><span class="mrow" id="MathJax-Span-394"><span class="texatom" id="MathJax-Span-395"><span class="mrow" id="MathJax-Span-396"><span class="mo" id="MathJax-Span-397" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>表</span></span></span></span><span class="texatom" id="MathJax-Span-398"><span class="mrow" id="MathJax-Span-399"><span class="mo" id="MathJax-Span-400" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>中</span></span></span></span><span class="texatom" id="MathJax-Span-401"><span class="mrow" id="MathJax-Span-402"><span class="mo" id="MathJax-Span-403" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>填</span></span></span></span><span class="texatom" id="MathJax-Span-404"><span class="mrow" id="MathJax-Span-405"><span class="mo" id="MathJax-Span-406" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>入</span></span></span></span><span class="texatom" id="MathJax-Span-407"><span class="mrow" id="MathJax-Span-408"><span class="mo" id="MathJax-Span-409" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>的</span></span></span></span><span class="texatom" id="MathJax-Span-410"><span class="mrow" id="MathJax-Span-411"><span class="mo" id="MathJax-Span-412" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>记</span></span></span></span><span class="texatom" id="MathJax-Span-413"><span class="mrow" id="MathJax-Span-414"><span class="mo" id="MathJax-Span-415" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>录</span></span></span></span><span class="texatom" id="MathJax-Span-416"><span class="mrow" id="MathJax-Span-417"><span class="mo" id="MathJax-Span-418" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>数</span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span><span style="position:absolute; top:-1.931em; left:50%; margin-left:-1.7em"><span class="mrow" id="MathJax-Span-419"><span class="texatom" id="MathJax-Span-420"><span class="mrow" id="MathJax-Span-421"><span class="mo" id="MathJax-Span-422" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>哈</span></span></span></span><span class="texatom" id="MathJax-Span-423"><span class="mrow" id="MathJax-Span-424"><span class="mo" id="MathJax-Span-425" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>希</span></span></span></span><span class="texatom" id="MathJax-Span-426"><span class="mrow" id="MathJax-Span-427"><span class="mo" id="MathJax-Span-428" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>表</span></span></span></span><span class="texatom" id="MathJax-Span-429"><span class="mrow" id="MathJax-Span-430"><span class="mo" id="MathJax-Span-431" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>的</span></span></span></span><span class="texatom" id="MathJax-Span-432"><span class="mrow" id="MathJax-Span-433"><span class="mo" id="MathJax-Span-434" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>长</span></span></span></span><span class="texatom" id="MathJax-Span-435"><span class="mrow" id="MathJax-Span-436"><span class="mo" id="MathJax-Span-437" style="font-size:70.7%"><span style='font-family:STIXGeneral,";;Arial Unicode MS",serif; font-size:80%; font-style:normal; font-weight:normal'>度</span></span></span></span></span><span style="display:inline-block; width:0px; height:2.4em"></span></span><span style="position:absolute; top:-1.27em; left:0em"><span style="border-left:4.62em solid; display:inline-block; overflow:hidden; width:0px; height:1.25px; vertical-align:0em"></span><span style="display:inline-block; width:0px; height:1.05em"></span></span></span></span></span><span style="display:inline-block; width:0px; height:2.8em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:2.277em; vertical-align:-0.826em"></span></span></nobr> ; 装填因子<nobr><span class="math" id="MathJax-Span-438" style="width:0.828em; display:inline-block"><span style="display:inline-block; position:relative; width:0.65em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-439"><span class="mi" id="MathJax-Span-440" style="font-family:MathJax_Math; font-style:italic">α</span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:0.691em; vertical-align:-0.076em"></span></span></nobr>标志哈希表的装满程度
直观的看:
- <nobr><span class="math" id="MathJax-Span-441" style="width:0.828em; display:inline-block"><span style="display:inline-block; position:relative; width:0.65em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-442"><span class="mi" id="MathJax-Span-443" style="font-family:MathJax_Math; font-style:italic">α</span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:0.691em; vertical-align:-0.076em"></span></span></nobr>越小,发生冲突的可能性就越小;
- <nobr><span class="math" id="MathJax-Span-444" style="width:0.828em; display:inline-block"><span style="display:inline-block; position:relative; width:0.65em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-445"><span class="mi" id="MathJax-Span-446" style="font-family:MathJax_Math; font-style:italic">α</span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:0.691em; vertical-align:-0.076em"></span></span></nobr>越大,代表着表中已填入的元素越多,再填入元素时发生冲突的可能性就越大。那么在查找时,给定值需要比较的关键字的个数就越多;
结论如下:
哈希表的平均查找长度是<nobr><span class="math" id="MathJax-Span-447" style="width:0.828em; display:inline-block"><span style="display:inline-block; position:relative; width:0.65em; height:0px; font-size:125%"><span style="position:absolute; top:-2.65em; left:0em"><span class="mrow" id="MathJax-Span-448"><span class="mi" id="MathJax-Span-449" style="font-family:MathJax_Math; font-style:italic">α</span></span><span style="display:inline-block; width:0px; height:2.65em"></span></span></span><span style="border-left:0em solid; display:inline-block; overflow:hidden; width:0px; height:0.691em; vertical-align:-0.076em"></span></span></nobr>的函数,而不是n的函数。因此,不管n多大,我们总是可以选择一个合适的装填因子以便将平均查找长度限定在一个范围内。(Java中HashMap的默认装填因子是0.75)
三、数据结构、数据类型
在看Java
的HashMap
之前,插播一点重要的数据结构要点。
1. 数据结构(data structure)
-
数据结构表达的是:用什么样的结构,组织一类数据。
-
分为逻辑结构和物理结构:
- 基本的逻辑结构有:集合、线性结构、树形结构、图;
- 物理结构:顺序存储、链式存储;
2. 数据类型(data type)
-
数据类型是和数据结构密切相关的,它是:值的集合和定义在这个值集上的一组操作的总称。
例如:C语言中的一种数据类型:整型变量,其值集为某个区间上的整数,定义在这些整数上的操作为加、减、乘、除和取模等算数运算。
-
高级语言中数据类型分为两类:
-
原子类型:值不可分解,是什么就是什么。如整型、字符型等;
-
结构类型:其值是由若干成分按某种结构组成的,因此可分解,并且它的成分可以是原子类型也可以是结构类型。比如数组,其值是由若干分量组成的,每个分量可以是整数,或者也可以是数组。
- 所以,结构类型可以看成由一种数据结构和定义在其上的一组操作组成。
-
-
所以你看,数据结构仅仅代表着一种结构,而我们在编程语言中是使用数据类型,如果编程语言想要实现某种数据结构,那么必须将其封装为一种数据类型,更狭义的说是数据类型中的结构类型。
3. 深入理解
也许你还是有些混沌,但是没关系,在哪里跌倒就在哪里睡着嘛~ 我再说点能让你深入理解的…
-
实际上,在计算机中,数据类型的概念并非局限于高级语言中,每个处理器[a]都提供了一组原子类型或结构类型。
-
例如,一个计算机硬件系统通常含有“位”、“字节”、“字”等原子类型,他们的操作通过计算机设计的一套指令系统直接由电路系统完成;
-
而高级程序语言提供的数据类型,其操作需要通过编译器或解释器转化为底层,即汇编语言或机器语言的数据类型来实现。
-
-
引入“数据类型”的目的,
-
从硬件角度看,是作为解释计算机内存中信息含义的一种手段,
-
而对使用数据类型的用户来说,实现了信息的隐蔽,即将一切用户不必了解的细节都封装在类型中。
- 例如,用户在使用“整数”类型时,既不需要了解“整数”在计算机内部是如何表示的,也不需要知道其操作是如何实现的。
- 如“两个整数求和”,程序员注重的仅仅是其“数学上求和”的抽象特性,而不是其硬件的“位”操作如何进行。
([a]:处理数据的单元,不局限于CPU,包括硬件系统、操作系统、高级语言、数据库等)
-
所以,
在编程语言中运用“数据结构”就是在使用被一层一层封装起来的某种数据类型
在编程语言中运用“数据结构”就是在使用被一层一层封装起来的某种数据类型
在编程语言中运用“数据结构”就是在使用被一层一层封装起来的某种数据类型
四、Java的HashMap
FAQ:
-
为什么要有
HashMap
?答:我非常期待能在Java 中使用Hash表 这种数据结构 ,因为它的快速存取特性。
-
Hash表 和
HashMap
的关系?答:Hash表 是一种逻辑数据结构,
HashMap
是Java中的一种数据类型(结构类型),它通过代码实现了Hash表这种数据结构,并在此结构上定义了一系列操作。 -
这一章节我们要干嘛?
答:首先要明白我们是在干嘛,我们是在分析一个叫做哈希表的数据结构吗?
不是!不是!不是!我们是在讨论一种高级程序设计语言中某个数据类型的实现,它实现了哈希表这种数据结构,但它绝不是哈希表本身,它就是它自己 -
HashMap
类型。不明白的话我再说一句:记不记得你学
Map
(HashMap
父接口)时见到的第一句描述“An object that maps keys to values. ”简单翻译就是:Map是一个键值对对象。但是,可没人告诉过你哈希表是键值对结构。 -
Java中的数据类型
答:有些话不明白的说出来,其实容易让人想不明白。所以我想说:
- 实际上,编程语言中数据类型都是层层封装的结果;
- 实际上,Java 中只有3类数据类型:原生类型(primitive8个)、数组、Object;
- 实际上,无论官方的集合框架也好,你自己创建的类也好,都只能是源自于Object并依赖于原有的这3类数据类型;
- 最终,到现在你可能才会发现,“数组”这种类型竟是如此的重要,在Java 中,如果没有数组作为基础结构,你是不可能构造出任何想实现某种数据结构的Object类型的。
其实有了以上内容,你应该可以轻松的看懂HashMap
的源码了,不过我们还是一起来看一下↓
-
上帝视角的
HashMap
-
HashMap
是基于数组来实现哈希表的,数组就好比内存储空间,数组的index
就好比内存的地址; -
HashMap
的每个记录就是一个Entry<K, V>
对象,数组中存储的就是这些对象; -
HashMap
的哈希函数 = 计算出hashCode
+ 计算出数组的index
; -
HashMap
解决冲突:使用链地址法,每个Entry
对象都有一个引用next
来指向链表的下一个Entry
; -
HashMap
的装填因子:默认为0.75; -
基本上
HashMap
就像这样:
-
-
new HashMap
/*** 1. 构造方法:最终使用的是这个构造方法 ***/ // 初始容量initialCapacity为16,装填因子loadFactor为0.75 public HashMap(int initialCapacity, float loadFactor) { if (initialCapacity < 0) throw new IllegalArgumentException("Illegal initial capacity: " + initialCapacity); if (initialCapacity > MAXIMUM_CAPACITY) initialCapacity = MAXIMUM_CAPACITY; if (loadFactor <= 0 || Float.isNaN(loadFactor)) throw new IllegalArgumentException("Illegal load factor: " + loadFactor); this.loadFactor = loadFactor; threshold = initialCapacity; init();//init可以忽略,方法默认为空{},当你需要集成HashMap实现自己的类型时可以重写此方法做一些事 } /*** 2. (静态/实例)成员变量 ***/ /** 默认的容量,容量必须是2的幂 */ static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16 /** 最大容量2的30次方 */ static final int MAXIMUM_CAPACITY = 1 << 30; /** 默认装填因子0.75 */ static final float DEFAULT_LOAD_FACTOR = 0.75f; /** 默认Entry数组 */ static final Entry<?,?>[] EMPTY_TABLE = {}; /** Entry数组:table */ transient Entry<K,V>[] table = (Entry<K,V>[]) EMPTY_TABLE; /** table中实际的Entry数量 */ transient int size; /** * size到达此门槛后,必须扩容table; * 值为capacity * load factor,默认为16 * 0.75 也就是12。 * 意味着默认情况构造情况下,当你存够12个时,table会第一次扩容 */ int threshold; /** 装填因子,值从一开构造HashMap时就被确定了,默认为0.75 */ final float loadFactor; /** * 哈希种子,实例化HashMap后在将要使用前设置的随机值,可以使得key的hashCode冲突更难出现 */ transient int hashSeed = 0; /** * The number of times this HashMap has been structurally modified * Structural modifications are those that change the number of mappings in * the HashMap or otherwise modify its internal structure (e.g., * rehash). This field is used to make iterators on Collection-views of * the HashMap fail-fast. (See ConcurrentModificationException). */ transient int modCount; /*** 3. Map.Entry<K,V>:数组table中实际存储的类型 ***/ static class Entry<K,V> implements Map.Entry<K,V> { final K key; // "Key-Value对"的Key V value; // "Key-Value对"的Key Entry<K,V> next; int hash; Entry(int h, K k, V v, Entry<K,V> n) { value = v; next = n;//链表的下一个Entry key = k; hash = h; } public final int hashCode() { return Objects.hashCode(getKey()) ^ Objects.hashCode(getValue()); } }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
-
存 - put(key, value)、解决冲突
/** 存放 **/ public V put(K key, V value) { if (table == EMPTY_TABLE) { inflateTable(threshold);//table会被初始化为长度16,且hashSeed会被赋值; } if (key == null) //HashMap允许key为null:在table中找到null key,然后设置Value,同时其hash为0; return putForNullKey(value); // a). 计算key的hashCode,下面详细说 int hash = hash(key); // b). 根据hashCode计算index int i = indexFor(hash, table.length); // c). 做覆盖,遍历index位置的Entry链表,*不是解决*冲突 for (Entry<K,V> e = table[i]; e != null; e = e.next) { Object k; if (e.hash == hash && ((k = e.key) == key || key.equals(k))) { // hashCode和equals都相等则表明:本次put是覆盖操作,下面return了被覆盖的老value V oldValue = e.value; e.value = value; e.recordAccess(this); return oldValue; } } modCount++; // d). 添加Entry,并解决冲突 // 如果需要增加table长度(size>threshold)就乘2增加,并重新计算每个元素在新table中的位置和转移 addEntry(hash, key, value, i); return null;//增加成功最后返回null } //详细说说上面的a). b). d). /** a). 为了防止低质量的hash函数,HashMap在这里会重新计算一遍key的hashCode **/ final int hash(Object k) { int h = hashSeed; if (0 != h && k instanceof String) {//字符串会被特殊处理,返回32bit的整数(就是int) return sun.misc.Hashing.stringHash32((String) k); } h ^= k.hashCode();//将key的hashCode与h按位异或,最后赋值给h // This function ensures that hashCodes that differ only by // constant multiples at each bit position have a bounded // number of collisions (approximately 8 at default load factor). h ^= (h >>> 20) ^ (h >>> 12); return h ^ (h >>> 7) ^ (h >>> 4); } /** * b). 计算此hashCode该被放入table的哪个index */ static int indexFor(int h, int length) { return h & (length-1);//与table的length - 1按位与,就能保证返回结果在0-length-1内 } /** * 解决冲突:链地址法 * d). addEntry(hash, key, value, i)最终是调用了此函数 */ void createEntry(int hash, K key, V value, int bucketIndex) { Entry<K,V> e = table[bucketIndex];// index的Entry拿出来 // put添加新元素是直接new Entry放在链头,如果有老的(有冲突)则将next设置为老的,如果没有正好设置next为null table[bucketIndex] = new Entry<>(hash, key, value, e);// 在构造函数中,e代表next size++; }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
-
取 - get(key)
//其实看完了最精髓的存,取的话就比较简单,就不放代码在这里了,仅说下思路。 // 1. 根据k使用hash(k)重新计算出hashCode // 2. 根据indexFor(int h, int length)计算出该k的index // 3. 如果该index处Entry的key与此k相等,就返回value,否则继续查看该Entry的next
- 1
- 2
- 3
- 4
- 5
HashMap延伸到Object对象
不知道大家还记得Object
的equals(
)和hashCode()
方法吗?(Java - Object类),Object
中这样描述道:
-
hashCode()
:general contract说到:equals的对象必须有相同的哈希码。 -
equals()
方法说:覆盖此方法,通常有必要重写hashCode()
方法,以维护其general contract;
就是说要记住下面的话:
覆盖equals方法通常有必要也覆盖hashCode方法,因为你必须保证对象equals,hashCode必须相等!
覆盖equals方法通常有必要也覆盖hashCode方法,因为你必须保证对象equals,hashCode必须相等!
覆盖equals方法通常有必要也覆盖hashCode方法,因为你必须保证对象equals,hashCode必须相等!
那为什么要保证这个保证呢?学完HashMap
我们就知道了原因:
-
首先,祖先类
Object
保证了以上话述:-
从Object
的equals()
默认是使用==
来判断的; -
hashCode()
是native
方法,它是直接依赖C
来算出的。
-
-
所以,做子孙们的必须要遵循祖制!:
那如果不遵循呢?会造成使用Hash函数的数据类型出现错误!!!,你就用不了哈希表这种数据结构了!!!
会出什么错?为什么会出错?我们上面看过了HashMap
源码,可以容易知道:
-
导致错误计算index,覆盖操作失效!
-
原因:
假设你将equals
覆盖为name
相等即相等(张三
等于张三
),不过你没覆盖hashCode()
;put(key)
操作,由于你的新key
和HashMap
中原有的老key
是两个不同的对象,尽管他们equals
,不过由于继承自Object
的hashCode()
方法给出了两个不同的hashCode
,在根据hashCode
计算出index
这一步,它们两个属于不同的index
!这直接导致本该是一次覆盖的操作,却做成了新增了一个值的操作!
所以,要避免出现这个问题,就必须在改写equals()
的同时改写hashCode()
,以保证对象equals则HashCode一致。
你可以看到官方提供的这些API类中,如果它需要覆盖equals()
那么在同时也都覆盖了hashCode()
,我们写class
时也要这样。
完。
参考文献:
[1] 严蔚敏,吴伟民.数据结构(C语言版).北京:清华大学出版社,2007