This commit is contained in:
krahets 2023-12-29 00:57:22 +08:00
parent faf297c890
commit a663ffc3ab
5 changed files with 5 additions and 5 deletions

View File

@ -13,7 +13,7 @@ icon: material/view-list-outline
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. 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.
## 本章内容 ## Chapter Contents
- [4.1   Array](https://www.hello-algo.com/chapter_array_and_linkedlist/array/) - [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.2   Linked List](https://www.hello-algo.com/chapter_array_and_linkedlist/linked_list/)

View File

@ -17,7 +17,7 @@ icon: material/timer-sand
It guides us in exploring deeper within the the dimensions of time and space, seeking more elegant solutions. It guides us in exploring deeper within the the dimensions of time and space, seeking more elegant solutions.
## 本章内容 ## Chapter Contents
- [2.1   Algorithm Efficiency Assessment](https://www.hello-algo.com/chapter_computational_complexity/performance_evaluation/) - [2.1   Algorithm Efficiency Assessment](https://www.hello-algo.com/chapter_computational_complexity/performance_evaluation/)
- [2.2   Iteration and Recursion](https://www.hello-algo.com/chapter_computational_complexity/iteration_and_recursion/) - [2.2   Iteration and Recursion](https://www.hello-algo.com/chapter_computational_complexity/iteration_and_recursion/)

View File

@ -17,7 +17,7 @@ icon: material/shape-outline
They offer a blueprint for the orderly organization of data, upon which algorithms come to life. They offer a blueprint for the orderly organization of data, upon which algorithms come to life.
## 本章内容 ## Chapter Contents
- [3.1   Classification of Data Structures](https://www.hello-algo.com/chapter_data_structure/classification_of_data_structure/) - [3.1   Classification of Data Structures](https://www.hello-algo.com/chapter_data_structure/classification_of_data_structure/)
- [3.2   Fundamental Data Types](https://www.hello-algo.com/chapter_data_structure/basic_data_types/) - [3.2   Fundamental Data Types](https://www.hello-algo.com/chapter_data_structure/basic_data_types/)

View File

@ -17,7 +17,7 @@ icon: material/calculator-variant-outline
She invites you to a dance, follow her steps, and enter the world of algorithms full of logic and beauty. She invites you to a dance, follow her steps, and enter the world of algorithms full of logic and beauty.
## 本章内容 ## Chapter Contents
- [1.1   Algorithms are Everywhere](https://www.hello-algo.com/chapter_introduction/algorithms_are_everywhere/) - [1.1   Algorithms are Everywhere](https://www.hello-algo.com/chapter_introduction/algorithms_are_everywhere/)
- [1.2   What is an Algorithm](https://www.hello-algo.com/chapter_introduction/what_is_dsa/) - [1.2   What is an Algorithm](https://www.hello-algo.com/chapter_introduction/what_is_dsa/)

View File

@ -17,7 +17,7 @@ icon: material/book-open-outline
May this book ring softly in your mind, leaving a unique and profound melody. May this book ring softly in your mind, leaving a unique and profound melody.
## 本章内容 ## Chapter Contents
- [0.1   About This Book](https://www.hello-algo.com/chapter_preface/about_the_book/) - [0.1   About This Book](https://www.hello-algo.com/chapter_preface/about_the_book/)
- [0.2   How to Read](https://www.hello-algo.com/chapter_preface/suggestions/) - [0.2   How to Read](https://www.hello-algo.com/chapter_preface/suggestions/)