xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-18 09:46:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-04-09 04:35:05 +08:00
parent fc4021ea99
commit 32b9491b24
249 changed files with 1523 additions and 1269 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_hashing/hash_map/index.html
+2 -2
View File
@@ -1778,8 +1778,8 @@
<ol>
<li><strong>无序数组</strong>：每个元素为 <code>[学号, 姓名]</code> ；</li>
<li><strong>有序数组</strong>：将 <code>1.</code> 中的数组按照学号从小到大排序；</li>
<li><strong>链表</strong>：每个结点的值为 <code>[学号, 姓名]</code> ；</li>
<li><strong>二叉搜索树</strong>：每个结点的值为 <code>[学号, 姓名]</code> ，根据学号大小来构建树；</li>
<li><strong>链表</strong>：每个节点的值为 <code>[学号, 姓名]</code> ；</li>
<li><strong>二叉搜索树</strong>：每个节点的值为 <code>[学号, 姓名]</code> ，根据学号大小来构建树；</li>
</ol>
<p>各项操作的时间复杂度如下表所示（详解可见<a href="https://www.hello-algo.com/chapter_tree/binary_search_tree/">二叉搜索树章节</a>）。无论是查找元素还是增删元素，哈希表的时间复杂度都是 <span class="arithmatex">\(O(1)\)</span>，全面胜出！</p>
<div class="center-table">