From a663ffc3abb72a6718ced712b17978d80de89db0 Mon Sep 17 00:00:00 2001 From: krahets Date: Fri, 29 Dec 2023 00:57:22 +0800 Subject: [PATCH] build --- docs-en/chapter_array_and_linkedlist/index.md | 2 +- docs-en/chapter_computational_complexity/index.md | 2 +- docs-en/chapter_data_structure/index.md | 2 +- docs-en/chapter_introduction/index.md | 2 +- docs-en/chapter_preface/index.md | 2 +- 5 files changed, 5 insertions(+), 5 deletions(-) diff --git a/docs-en/chapter_array_and_linkedlist/index.md b/docs-en/chapter_array_and_linkedlist/index.md index ee0df5240..96be48445 100644 --- a/docs-en/chapter_array_and_linkedlist/index.md +++ b/docs-en/chapter_array_and_linkedlist/index.md @@ -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. -## 本章内容 +## Chapter Contents - [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/) diff --git a/docs-en/chapter_computational_complexity/index.md b/docs-en/chapter_computational_complexity/index.md index db3800931..1a4198643 100644 --- a/docs-en/chapter_computational_complexity/index.md +++ b/docs-en/chapter_computational_complexity/index.md @@ -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. -## 本章内容 +## Chapter Contents - [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/) diff --git a/docs-en/chapter_data_structure/index.md b/docs-en/chapter_data_structure/index.md index 7966e7227..bbabd0c47 100644 --- a/docs-en/chapter_data_structure/index.md +++ b/docs-en/chapter_data_structure/index.md @@ -17,7 +17,7 @@ icon: material/shape-outline 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.2   Fundamental Data Types](https://www.hello-algo.com/chapter_data_structure/basic_data_types/) diff --git a/docs-en/chapter_introduction/index.md b/docs-en/chapter_introduction/index.md index 87736a1cd..8cf57153b 100644 --- a/docs-en/chapter_introduction/index.md +++ b/docs-en/chapter_introduction/index.md @@ -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. -## 本章内容 +## Chapter Contents - [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/) diff --git a/docs-en/chapter_preface/index.md b/docs-en/chapter_preface/index.md index 1f7ef8679..77a3f581a 100644 --- a/docs-en/chapter_preface/index.md +++ b/docs-en/chapter_preface/index.md @@ -17,7 +17,7 @@ icon: material/book-open-outline 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.2   How to Read](https://www.hello-algo.com/chapter_preface/suggestions/)