2023-06-02 01:35:02 +08:00
|
|
|
---
|
|
|
|
|
comments: true
|
2023-07-17 17:51:03 +08:00
|
|
|
icon: material/table-search
|
2023-06-02 01:35:02 +08:00
|
|
|
---
|
|
|
|
|
|
|
|
|
|
# 6. 散列表
|
|
|
|
|
|
|
|
|
|
<div class="center-table" markdown>
|
|
|
|
|
|
2023-07-29 04:48:28 +08:00
|
|
|
{ width="600" }
|
2023-06-02 01:35:02 +08:00
|
|
|
|
|
|
|
|
</div>
|
2023-07-17 17:51:03 +08:00
|
|
|
|
2023-08-03 04:37:52 +08:00
|
|
|
!!! abstract
|
|
|
|
|
|
|
|
|
|
在计算机世界中，散列表如同一位智能的图书管理员。
|
|
|
|
|
|
2023-08-03 05:16:57 +08:00
|
|
|
他知道如何计算索书号，从而可以快速找到目标书籍。
|
2023-08-03 04:37:52 +08:00
|
|
|
|
2023-07-17 17:51:03 +08:00
|
|
|
## 本章内容
|
|
|
|
|
|
|
|
|
|
- [6.1 哈希表](https://www.hello-algo.com/chapter_hashing/hash_map/)
|
|
|
|
|
- [6.2 哈希冲突](https://www.hello-algo.com/chapter_hashing/hash_collision/)
|
|
|
|
|
- [6.3 哈希算法](https://www.hello-algo.com/chapter_hashing/hash_algorithm/)
|
|
|
|
|
- [6.4 小结](https://www.hello-algo.com/chapter_hashing/summary/)
|
