You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
23 lines
970 B
23 lines
970 B
11 months ago
|
---
|
||
|
comments: true
|
||
|
icon: material/view-list-outline
|
||
|
---
|
||
|
|
||
|
# Chapter 4. Arrays and Linked Lists
|
||
|
|
||
|
![Arrays and Linked Lists](../assets/covers/chapter_array_and_linkedlist.jpg){ class="cover-image" }
|
||
|
|
||
|
!!! abstract
|
||
|
|
||
|
The world of data structures is like a solid brick wall.
|
||
|
|
||
|
The bricks of an array are neatly arranged, each closely connected to the next. In contrast, the bricks of a linked list are scattered, with vines of connections freely weaving through the gaps between bricks.
|
||
|
|
||
|
## 本章内容
|
||
|
|
||
|
- [4.1 Array](https://www.hello-algo.com/chapter_array_and_linkedlist/array/)
|
||
|
- [4.2 Linked List](https://www.hello-algo.com/chapter_array_and_linkedlist/linked_list/)
|
||
|
- [4.3 List](https://www.hello-algo.com/chapter_array_and_linkedlist/list/)
|
||
|
- [4.4 Memory and Cache](https://www.hello-algo.com/chapter_array_and_linkedlist/ram_and_cache/)
|
||
|
- [4.5 Summary](https://www.hello-algo.com/chapter_array_and_linkedlist/summary/)
|