Java

DuHouAn · DuHouAn · commit 5f642e81c29f · 2019-11-08T15:27:03.000+08:00
diff --git a/docs/data_structure/9_&#21704;&#24076;&#34920;.md b/docs/data_structure/9_&#21704;&#24076;&#34920;.md
@@ -283,6 +283,9 @@ public class HashTable<K,V> {
 ```
 
 - &#21704;&#24076;&#34920;&#20855;&#20307;&#21151;&#33021;&#23454;&#29616;
+
+
+
 ```java
 public void add(K key,V value){
     TreeMap<K,V> map=hashtable[hash(key)];
@@ -321,11 +324,19 @@ public V get(K key){
 }
 ```
 
+
+
 - &#21704;&#24076;&#34920;&#38142;&#34920;&#27861;&#26102;&#38388;&#22797;&#26434;&#24230;&#20998;&#26512;
 
+
 <div align="center"><img src="https://gitee.com/duhouan/ImagePro/raw/master/java-notes/dataStructure/hash//13_5.png" width="600"/></div>
 
+
+
 ## &#21704;&#24076;&#34920;&#30340;&#21160;&#24577;&#31354;&#38388;&#22788;&#29702;
+
+
+
 <div align="center"><img src="https://gitee.com/duhouan/ImagePro/raw/master/java-notes/dataStructure/hash//13_6.png" width="600"/></div>
 
 
@@ -422,12 +433,16 @@ public class HashTable2<K,V> {
 }
 ```
 
+
+
 - &#26102;&#38388;&#22797;&#26434;&#24230;&#20998;&#26512;&#65306;
 
 &#24179;&#22343;&#26102;&#38388;&#22797;&#26434;&#24230;&#65306;O(1)
 
 &#23454;&#38469;&#19978;&#27599;&#20010;&#25805;&#20316;&#30340;&#26102;&#38388;&#22797;&#26434;&#24230;&#26159;&#65306;O( log(lowerTol) ) ~ O( log(upperTol) ), &#32780; lowerTol &#21644; upperTol &#37117;&#26159;&#24120;&#25968;&#12290;
 
+
+
 ##  &#20248;&#21270;&#21704;&#24076;&#34920;
 
 ```java

-Original file line number
+Diff line change
 ```
 - 哈希表具体功能实现
++
++
++
 ```java
 public void add(K key,V value){
     TreeMap<K,V> map=hashtable[hash(key)];
+}
 ```
++
++
 - 哈希表链表法时间复杂度分析
++
 <div align="center"><img src="https://gitee.com/duhouan/ImagePro/raw/master/java-notes/dataStructure/hash//13_5.png" width="600"/></div>
++
++
 ## 哈希表的动态空间处理
++
++
++
 <div align="center"><img src="https://gitee.com/duhouan/ImagePro/raw/master/java-notes/dataStructure/hash//13_6.png" width="600"/></div>
+}
 ```
++
++
 - 时间复杂度分析：
 平均时间复杂度：O(1)
 实际上每个操作的时间复杂度是：O( log(lowerTol) ) ~ O( log(upperTol) ), 而 lowerTol 和 upperTol 都是常数。
++
++
 ##  优化哈希表
 ```java