open-source/JavaYouth
1
0
Fork 0
mirror of https://github.com/youthlql/JavaYouth.git synced 2026-04-21 10:33:41 +00:00
Code Issues Packages Projects Releases Wiki Activity

cos测试完毕，图床切回原版

Browse Source
This commit is contained in:
youthlql
2022-03-16 01:23:41 +08:00
parent 8c89dac3bf
commit 0660078ffa
47 changed files with 737 additions and 737 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
docs/Java/collection/HashMap-JDK8源码讲解及常见面试题.md
View File

@@ -27,7 +27,7 @@ date: 2020-11-01 10:22:05
在JDK8中，优化了HashMap的数据结构，引入了红黑树。即HashMap的数据结构：数组+链表+红黑树。HashMap变成了这样。
<img src="https://img.imlql.cn/youthlql@1.0.8/Java_collection/HashMap/JDK8/0001.png">
<img src="https://npm.elemecdn.com/youthlql@1.0.8/Java_collection/HashMap/JDK8/0001.png">
### 为什么要引入红黑树
@@ -456,7 +456,7 @@ Process finished with exit code 0
JDK8 hash的运算原理：高位参与低位运算，使得hash更加均匀。
<img src="https://img.imlql.cn/youthlql@1.0.8/Java_collection/HashMap/JDK8/0002.png">
<img src="https://npm.elemecdn.com/youthlql@1.0.8/Java_collection/HashMap/JDK8/0002.png">
@@ -569,7 +569,7 @@ JDK8 hash的运算原理：高位参与低位运算，使得hash更加均匀。
JDK8扩容时，数据在数组下标的计算方式
<img src="https://img.imlql.cn/youthlql@1.0.8/Java_collection/HashMap/JDK8/0003.png">
<img src="https://npm.elemecdn.com/youthlql@1.0.8/Java_collection/HashMap/JDK8/0003.png">
* `JDK8`根据此结论作出的新元素存储位置计算规则非常简单，提高了扩容效率。