From 6a1567cd2e9bf3942b50442085cab5c60b437227 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E6=9C=80=E8=BF=91=E5=9C=A8=E5=AD=A6=E6=A1=8C=E7=90=83?= Date: Wed, 30 Aug 2023 17:04:20 +0800 Subject: [PATCH 1/5] =?UTF-8?q?feat:=20=E6=9B=B4=E6=96=B0=E6=96=87?= =?UTF-8?q?=E6=A1=A3?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- code/ds/BinaryInsertSort.cpp | 24 ++---- code/ds/BinaryInsertSort.js | 18 +---- code/ds/BubbleSort.cpp | 19 ++--- code/ds/BubbleSort.js | 27 +------ code/ds/LinkList.cpp | 78 ++++++------------- code/ds/LinkStack.cpp | 20 +++-- code/ds/QuickSort.cpp | 3 +- code/ds/ShellSort.js | 41 ++-------- code/ds/SqList.cpp | 6 +- .../ds/basic-introduction/1.basic_concepts.md | 11 --- .../2.three_elements_of_data_structure.md | 12 --- .../3.algorithm_and_algorithm_evaluation.md | 11 --- .../ds/basic-introduction/readme.md | 10 --- docs/manuscripts/ds/coding/algorithm.md | 8 -- .../1.basic_concept_and_operation.md | 11 --- .../2.sequential_representation.md | 10 --- .../ds/linear-table/3.chain_representation.md | 13 ---- .../ds/linear-table/4.double_linked_list.md | 12 --- .../ds/linear-table/5.circular_list.md | 12 --- .../ds/linear-table/6.static_linked_list.md | 12 --- ...ison_of_sequential_list_and_linked_list.md | 12 --- .../8.selection_of_storage_structure.md | 15 ---- .../9.piecemeal_knowledge_supplement.md | 11 --- docs/manuscripts/ds/linear-table/readme.md | 9 --- .../ds/栈和队列/1.栈的基本概念和基本操作.md | 11 --- .../ds/栈和队列/2.栈的顺序存储结构.md | 11 --- .../ds/栈和队列/3.栈的链式存储结构.md | 9 --- .../ds/栈和队列/4.队列的基本概念和操作.md | 9 --- .../ds/栈和队列/5.队列的顺序存储结构.md | 10 --- .../ds/栈和队列/6.队列的链式存储结构.md | 9 --- .../ds/栈和队列/7.栈和队列的应用.md | 11 --- .../ds/栈和队列/8.特殊矩阵的压缩存储.md | 9 --- docs/manuscripts/ds/栈和队列/readme.md | 10 --- scripts/deploy.sh | 1 - 34 files changed, 64 insertions(+), 431 deletions(-) diff --git a/code/ds/BinaryInsertSort.cpp b/code/ds/BinaryInsertSort.cpp index a1ef8ab..08e0936 100644 --- a/code/ds/BinaryInsertSort.cpp +++ b/code/ds/BinaryInsertSort.cpp @@ -1,30 +1,22 @@ -/* - * @Description: 折半插入算法【伪代码】 - * @Version: Beta1.0 - * @Author: 【B站&公众号】Rong姐姐好可爱 - * @Date: 2020-04-15 18:27:59 - * @LastEditors: 【B站&公众号】Rong姐姐好可爱 - * @LastEditTime: 2021-03-27 12:19:13 - */ - +// 折半查找 void BinaryInsertSort(ElemType Arr[],int n){ - int i,j,lowIndex,heightIndex,midIndex; + int i,j,lowIndex,highIndex,midIndex; for(i=2;j<=n;i++){ // 将待排序的元素暂存在Arr[0]上 Arr[0]=Arr[i]; lowIndex=1; // 左侧子表 折半查找起始位置 - heightIndex=i-1; // 左侧子表 折半查找结束位置 + highIndex=i-1; // 左侧子表 折半查找结束位置 - while(lowIndex<=heightIndex){ + while(lowIndex<=highIndex){ // 左侧有序子表的中间位置角标 midIndex=(lowIndex+heightIndex)/2; if(Arr[midIndex].key>Arr[0].key){ // 小于中间元素，插入位置在子表左侧 - heightIndex=mid-1 + highIndex=mid-1 }else{ // 大于或者等于中间元素，插入位置在子表右侧 lowIndex=midIndex+1; @@ -33,11 +25,11 @@ void BinaryInsertSort(ElemType Arr[],int n){ // 跳出循环需要（lowIndex>heightIndex），说明待插入位置的角标在heightIndex之后，为 heightIndex+1,此时需要将（heightIndex，i）之间的所有元素后移 - for(j=i-1;j>heightIndex;--j){ + for(j=i-1;j>highIndex;--j){ Arr[j+1]=Arr[j] } - // 后移完成后，将元素Arr[0]赋值到位置（hightIndex+1）上 - Arr[heightIndex+1]=Arr[0] + // 后移完成后，将元素Arr[0]赋值到位置（highIndex+1）上 + Arr[highIndex+1]=Arr[0] } } diff --git a/code/ds/BinaryInsertSort.js b/code/ds/BinaryInsertSort.js index 1c0e92b..391384a 100644 --- a/code/ds/BinaryInsertSort.js +++ b/code/ds/BinaryInsertSort.js @@ -1,21 +1,11 @@ -/* - * @Description: 折半插入排序【JavaScript版本】 - * @Version: Beta1.0 - * @Author: 【B站&公众号】Rong姐姐好可爱 - * @Date: 2021-03-27 12:35:17 - * @LastEditors: 【B站&公众号】Rong姐姐好可爱 - * @LastEditTime: 2021-03-27 12:50:00 - */ - /** - * 折半插入排序 - * @param arr - * @param len + * 折半插入排序【JavaScript版本】 */ function binaryInsertSort(arr, len) { // 数组长度校验【非必须】 - len = arr.length === len ? len : arr.length - + len = arr.length === len + ? len + : arr.length for (let i = 1; i < len; i++) { const temp = arr[i] diff --git a/code/ds/BubbleSort.cpp b/code/ds/BubbleSort.cpp index 9eafd90..b3040c8 100644 --- a/code/ds/BubbleSort.cpp +++ b/code/ds/BubbleSort.cpp @@ -1,13 +1,4 @@ -/* - * @Description: 冒泡排序 - * @Version: Beta1.0 - * @Author: 【B站&公众号】Rong姐姐好可爱 - * @Date: 2021-03-31 08:24:18 - * @LastEditors: 【B站&公众号】Rong姐姐好可爱 - * @LastEditTime: 2021-04-06 07:26:15 - */ - - +// 冒泡排序 void BubbleSwapSort(ElemType A[], int n){ for(i=0;ii;j--){ if(A[j-1].key>A[j].key){ - + // 将两个元素A[j-1]、A[j]进行交换，有多种方法 swap(A[j-1],A[j]) // 确认已发生交换 @@ -35,7 +26,7 @@ void BubbleSwapSort(ElemType A[], int n){ /** * 加减法实现两个元素值互换 - * + * */ void swap(int a, int b){ // 此时a为两值的和 @@ -48,8 +39,8 @@ void swap(int a, int b){ /** * 临时变量实现两个元素值的互换 - * - */ + * + */ void swap(int a,int b){ int temp; temp=a; diff --git a/code/ds/BubbleSort.js b/code/ds/BubbleSort.js index fc318d7..f3aac8c 100644 --- a/code/ds/BubbleSort.js +++ b/code/ds/BubbleSort.js @@ -1,13 +1,8 @@ -/* - * @Description: 冒泡排序【JavaScript版本】 - * @Version: Beta1.0 - * @Author: 【B站&公众号】Rong姐姐好可爱 - * @Date: 2021-04-06 07:26:59 - * @LastEditors: 【B站&公众号】Rong姐姐好可爱 - * @LastEditTime: 2021-04-06 08:01:19 + + +/** + * 冒泡排序【JavaScript版本】 */ - - function BubbleSort(arr, len) { // 校正数组的长度 len = arr.length === len ? len : arr.length @@ -38,20 +33,6 @@ function BubbleSort(arr, len) { return arr } - -/** - * 加减法交换元素的值 - * 注意：JavaScript中使用需要考虑到作用域的问题 - * @param a - * @param b - */ -function swap(a, b) { - a = a + b - b = a - b - a = a - b -} - - const initArr = [1, 5, 8, 3, 2, 9, 16] console.log(`冒泡排序前：${initArr}`) const sortedArr = BubbleSort(initArr, 7) diff --git a/code/ds/LinkList.cpp b/code/ds/LinkList.cpp index 1d050fc..d721810 100644 --- a/code/ds/LinkList.cpp +++ b/code/ds/LinkList.cpp @@ -9,102 +9,81 @@ -/* - * @Description: 单链表头插法 - * @Version: Beta1.0 - * @Author: 【B站&公众号】Rong姐姐好可爱 - * @Date: 2020-03-04 23:38:04 - * @LastEditors: 【B站&公众号】Rong姐姐好可爱 - * @LastEditTime: 2020-03-04 23:39:16 - */ +// 单链表头插法 LinkList CreateListWithStartNode(LinkList &L){ - + LNode *s; int x; L=(LinkList)malloc(sizeof(LNode)); // 创建头结点L L->next=NULL; // 初始化空链表 - + // 控制台输入值 scanf("%d",&x); - + // 输入9999 表示结束 while(x!==9999){ // 开辟新结点存储空间 - s=(LNode*)malloc(sizeof(LNode)); + s=(LNode*)malloc(sizeof(LNode)); // 结点数据域赋值 - s->data=x; + s->data=x; // 修改指针，新结点插入表中【注意：L->next为头结点的指针域】 s->next=L->next; L->next=s; scanf("%d",&x); } - + // 返回单链表 return L; } -/* - * @Description: 单链表尾插法 - * @Version: Beta1.0 - * @Author: 【B站&公众号】Rong姐姐好可爱 - * @Date: 2020-03-04 23:38:04 - * @LastEditors: 【B站&公众号】Rong姐姐好可爱 - * @LastEditTime: 2020-03-04 23:39:16 - */ +// 单链表尾插法 LinkList CreateListWithEndNode(LinkList &L){ - - + + int x; // 输入结点值 L=(LinkList)malloc(sizeof(LNode)); LNode *s; // 新结点s LNode *r=L; // r为尾指针 - + // 控制台输入值 scanf("%d",&x); - + while(x!==9999){ // 开辟新结点存储空间 s=(LNode *)malloc(sizeof(LNode)); - + // 新结点s的数据域赋值为x s->data=x; // 单链表L的尾指针指向新的结点s r->next=s; - + // 指针r指向新的表尾结点 r=s; scanf("%d",&x); } - + // 表尾指针置空【重要】 r->next=NULL; // 返回单链表 return L; - + } -/* - * @Description: 单链表按序号查找 - * @Version: Beta1.0 - * @Author: 【B站&公众号】Rong姐姐好可爱 - * @Date: 2020-03-04 23:38:04 - * @LastEditors: 【B站&公众号】Rong姐姐好可爱 - * @LastEditTime: 2020-03-04 23:39:16 - */ +// 单链表按序号查找 LNode *GetElem(LinkList L,int i){ int j=1; // 查询计数，初始为1 LNode *p=L->next; // 单链表头结点指针赋值给指针p - + // 第0个元素，则指向头结点，返回头结点 if(i==0){ // 头结点包含数据域和指针域 return L; } - + // 不等于0，却小于1，则i为负数无效，直接返回NULL，查询结果空； if(i<1){ return NULL; @@ -112,7 +91,7 @@ LNode *GetElem(LinkList L,int i){ // p存在且计数没有走到初始i的位置 while(p&&jnext; @@ -125,19 +104,12 @@ LNode *GetElem(LinkList L,int i){ // 跳出循环，返回第i个结点的指针 return p; - + } -/* - * @Description: 单链表按值查找 - * @Version: Beta1.0 - * @Author: 【B站&公众号】Rong姐姐好可爱 - * @Date: 2020-03-04 23:38:04 - * @LastEditors: 【B站&公众号】Rong姐姐好可爱 - * @LastEditTime: 2020-03-04 23:39:16 - */ +//单链表按值查找 LNode *LocateElem(LinkList L,ElemType e){ - + // 指针【哨兵】 LNode *p=L->next; // 从第1个结点开始查找数据域(data)为e的结点 @@ -145,11 +117,11 @@ LNode *LocateElem(LinkList L,ElemType e){ // 无法匹配，指针后移 p=p->next; } - + // 注意：p为NULL的时候，说明单链表已经遍历的尾结点了，跳出循环，没有找到目标结点； // 查找到第1个匹配的结点，跳出循环，返回结点指针 return p; - // + // } diff --git a/code/ds/LinkStack.cpp b/code/ds/LinkStack.cpp index d13e89e..ed9ae55 100644 --- a/code/ds/LinkStack.cpp +++ b/code/ds/LinkStack.cpp @@ -15,14 +15,14 @@ typedef struct LinkNode{ // 更为详细的定义 -typedef struct StackNode +typedef struct StackNode { int data;//结点数据域 struct StackNode* next;//结点指针域 }StackNode,* Linktop; - + //链栈的数据结构 -typedef struct LinkStack +typedef struct LinkStack { Linktop top; //栈顶结点,定义了一个指向上个结构体的指针 int count;//元素个数 @@ -47,20 +47,18 @@ bool linkStackPushNode(LinkStack* linkStack,int e){ // 开辟栈结点元素内存控件 StackNode* node = (StackNode*)malloc(sizeof(StackNode)); // 新结点指针域指向链表，即栈顶指针位置，元素加入链表 - node->next = linkStack->top; + node->next = linkStack->top; // 新结点数据域赋值 node->data = e; // 元素进栈，移动栈顶指针，指向新入栈的元素 - linkStack->top = node; - // 链栈元素总数+1 + linkStack->top = node; + // 链栈元素总数+1 linkStack->count++; //链栈入栈成功，返回true return true; } - - /* * @Description: 基于单链表链栈的出栈操作 * @Version: Beta1.0 @@ -81,10 +79,10 @@ bool linkStackPopNode(LinkStack* linkStack,int *e){ // 结点元素数据域赋值给变量e *e = linkStack->data; // 移动栈顶指向，栈顶指针指向待出栈结点的后继结点 - linkStack->top = node->next; + linkStack->top = node->next; // 变量e已被赋值，释放链栈出栈元素的内存控件 - free(node); - // 链栈元素个数-1 + free(node); + // 链栈元素个数-1 linkStack->count--; // 出栈成功，返回true. return true; diff --git a/code/ds/QuickSort.cpp b/code/ds/QuickSort.cpp index 7eb0232..87d747f 100644 --- a/code/ds/QuickSort.cpp +++ b/code/ds/QuickSort.cpp @@ -9,7 +9,6 @@ void QuickSort(ElemType A[] , int low , int high){ - // low > high 表角标越界，low=high 子表只有一个元素，不需要进行快排，已经有序 if(low=pivot) --high A[low]=A[high] // 比pivot小的都移到左表 注意--high 从后往前遍历 - while(low temp; --j) { - // 后移 - arr[j + 1] = arr[j] - } - // 跳出循环逻辑，出现arr[j] > arr[j-1] - - // 哨兵即待排序的 - arr[j + 1] = temp - } - } - - return arr -} - - const dealArr = [5, 8, 2, 16, 3, 9, 1] console.log('插入排序前：', dealArr) const sortResult = shellSort(dealArr, 7) @@ -99,8 +69,9 @@ console.log('插入排序后：', sortResult) /** * 简化的希尔排序 + * - 返回已排序号的数组，从小到大 * @param {Array} arr - * @returns 返回已排序号的数组，从小到大 + * @returns */ function shellSortBetter(arr) { const len = arr.length @@ -108,10 +79,10 @@ function shellSortBetter(arr) { while (increment !== 0) { for (let i = increment; i < len; i++) { const temp = arr[i] - for (var j = i - increment; j >= 0 && temp < arr[j]; j -= increment) { + for (let j = i - increment; j >= 0 && temp < arr[j]; j -= increment) { arr[j + increment] = arr[j] } - arr[j + increment] = temp + arr[i + increment] = temp } increment = Math.floor(increment / 2) } diff --git a/code/ds/SqList.cpp b/code/ds/SqList.cpp index 7b4a15f..9254a5d 100644 --- a/code/ds/SqList.cpp +++ b/code/ds/SqList.cpp @@ -7,8 +7,6 @@ * @LastEditTime: 2021-02-23 07:48:26 */ - - // 基础结构体 define MaxSize 50; @@ -60,7 +58,7 @@ bool ListDelete(SqList &L, int i, ElemType &e){ if(L.length >= MaxSize){ return false; } - + // 引用变量e赋值 e=L.data[i-1] @@ -70,7 +68,7 @@ bool ListDelete(SqList &L, int i, ElemType &e){ L.data[j-1]=L.data[j]; } - // 此时，表L中的表尾元素和倒数第二个元素值一样，将表的长度-1 + // 此时，表L中的表尾元素和倒数第二个元素值一样，将表的长度-1 // 表长度减1 L.length--; diff --git a/docs/manuscripts/ds/basic-introduction/1.basic_concepts.md b/docs/manuscripts/ds/basic-introduction/1.basic_concepts.md index b5abea3..c8b405c 100644 --- a/docs/manuscripts/ds/basic-introduction/1.basic_concepts.md +++ b/docs/manuscripts/ds/basic-introduction/1.basic_concepts.md @@ -1,15 +1,4 @@ - - - - ## 基础概念 ### 数据 diff --git a/docs/manuscripts/ds/basic-introduction/2.three_elements_of_data_structure.md b/docs/manuscripts/ds/basic-introduction/2.three_elements_of_data_structure.md index b13a260..9d72b60 100644 --- a/docs/manuscripts/ds/basic-introduction/2.three_elements_of_data_structure.md +++ b/docs/manuscripts/ds/basic-introduction/2.three_elements_of_data_structure.md @@ -1,16 +1,4 @@ - - - - - ## 数据结构三要素 - 数据的逻辑结构 diff --git a/docs/manuscripts/ds/basic-introduction/3.algorithm_and_algorithm_evaluation.md b/docs/manuscripts/ds/basic-introduction/3.algorithm_and_algorithm_evaluation.md index 8070d6a..f176118 100644 --- a/docs/manuscripts/ds/basic-introduction/3.algorithm_and_algorithm_evaluation.md +++ b/docs/manuscripts/ds/basic-introduction/3.algorithm_and_algorithm_evaluation.md @@ -1,15 +1,4 @@ - - - - ## 算法和算法评价 diff --git a/docs/manuscripts/ds/basic-introduction/readme.md b/docs/manuscripts/ds/basic-introduction/readme.md index eb812f8..7db634c 100644 --- a/docs/manuscripts/ds/basic-introduction/readme.md +++ b/docs/manuscripts/ds/basic-introduction/readme.md @@ -1,12 +1,2 @@ - - - ![](./basic_introduction.png) \ No newline at end of file diff --git a/docs/manuscripts/ds/coding/algorithm.md b/docs/manuscripts/ds/coding/algorithm.md index 7605559..6ae8d0a 100644 --- a/docs/manuscripts/ds/coding/algorithm.md +++ b/docs/manuscripts/ds/coding/algorithm.md @@ -1,11 +1,3 @@ - ## 算法恶补 diff --git a/docs/manuscripts/ds/linear-table/1.basic_concept_and_operation.md b/docs/manuscripts/ds/linear-table/1.basic_concept_and_operation.md index d238c28..2121774 100644 --- a/docs/manuscripts/ds/linear-table/1.basic_concept_and_operation.md +++ b/docs/manuscripts/ds/linear-table/1.basic_concept_and_operation.md @@ -1,15 +1,4 @@ - - - - # 线性表的基础概念和基本操作 > 强调线性表是一种逻辑结构，不是存储结构 diff --git a/docs/manuscripts/ds/linear-table/2.sequential_representation.md b/docs/manuscripts/ds/linear-table/2.sequential_representation.md index 489466a..75d422b 100644 --- a/docs/manuscripts/ds/linear-table/2.sequential_representation.md +++ b/docs/manuscripts/ds/linear-table/2.sequential_representation.md @@ -1,14 +1,4 @@ - - - # 线性表的顺序表示 diff --git a/docs/manuscripts/ds/linear-table/3.chain_representation.md b/docs/manuscripts/ds/linear-table/3.chain_representation.md index bcb675e..38e6ad7 100644 --- a/docs/manuscripts/ds/linear-table/3.chain_representation.md +++ b/docs/manuscripts/ds/linear-table/3.chain_representation.md @@ -1,16 +1,3 @@ - - - - - - # 线性表的链式表示 顺序表的插入、删除操作需要移动大量元素，影响了运行效率（虽然时间复杂度为O(1)的情况也存在）。 diff --git a/docs/manuscripts/ds/linear-table/4.double_linked_list.md b/docs/manuscripts/ds/linear-table/4.double_linked_list.md index 78665f1..75b03b5 100644 --- a/docs/manuscripts/ds/linear-table/4.double_linked_list.md +++ b/docs/manuscripts/ds/linear-table/4.double_linked_list.md @@ -1,16 +1,4 @@ - - - - - # 双链表 diff --git a/docs/manuscripts/ds/linear-table/5.circular_list.md b/docs/manuscripts/ds/linear-table/5.circular_list.md index f3436d9..f51a8f5 100644 --- a/docs/manuscripts/ds/linear-table/5.circular_list.md +++ b/docs/manuscripts/ds/linear-table/5.circular_list.md @@ -1,16 +1,4 @@ - - - - - # 循环链表 - 循环单链表 diff --git a/docs/manuscripts/ds/linear-table/6.static_linked_list.md b/docs/manuscripts/ds/linear-table/6.static_linked_list.md index 605143a..37b4318 100644 --- a/docs/manuscripts/ds/linear-table/6.static_linked_list.md +++ b/docs/manuscripts/ds/linear-table/6.static_linked_list.md @@ -1,16 +1,4 @@ - - - - - # 静态链表 > 借助数组来描述线性表的链式存储结构，结点元素同样存在数据域`data`和指针域`next` diff --git a/docs/manuscripts/ds/linear-table/7.comparison_of_sequential_list_and_linked_list.md b/docs/manuscripts/ds/linear-table/7.comparison_of_sequential_list_and_linked_list.md index 344063f..873e463 100644 --- a/docs/manuscripts/ds/linear-table/7.comparison_of_sequential_list_and_linked_list.md +++ b/docs/manuscripts/ds/linear-table/7.comparison_of_sequential_list_and_linked_list.md @@ -1,15 +1,3 @@ - - - - - # 顺序表和链表的比较 diff --git a/docs/manuscripts/ds/linear-table/8.selection_of_storage_structure.md b/docs/manuscripts/ds/linear-table/8.selection_of_storage_structure.md index f1602cb..35e60dc 100644 --- a/docs/manuscripts/ds/linear-table/8.selection_of_storage_structure.md +++ b/docs/manuscripts/ds/linear-table/8.selection_of_storage_structure.md @@ -1,20 +1,5 @@ - - - - - - # 存储结构的选取 - - ### 基于存储的考虑 - 对线性表的长度和存储规模难以估计时，不宜采用顺序表存储 diff --git a/docs/manuscripts/ds/linear-table/9.piecemeal_knowledge_supplement.md b/docs/manuscripts/ds/linear-table/9.piecemeal_knowledge_supplement.md index d794471..afe9630 100644 --- a/docs/manuscripts/ds/linear-table/9.piecemeal_knowledge_supplement.md +++ b/docs/manuscripts/ds/linear-table/9.piecemeal_knowledge_supplement.md @@ -1,15 +1,4 @@ - - - - # 零碎知识补充 - 无论是链表的插入还是删除操作，必须保证不断链【重要】 diff --git a/docs/manuscripts/ds/linear-table/readme.md b/docs/manuscripts/ds/linear-table/readme.md index 3609c2d..c00d10f 100644 --- a/docs/manuscripts/ds/linear-table/readme.md +++ b/docs/manuscripts/ds/linear-table/readme.md @@ -1,12 +1,3 @@ - - # 线性表 ![](./线性表_水印.png) \ No newline at end of file diff --git a/docs/manuscripts/ds/栈和队列/1.栈的基本概念和基本操作.md b/docs/manuscripts/ds/栈和队列/1.栈的基本概念和基本操作.md index 9324e59..820c30c 100644 --- a/docs/manuscripts/ds/栈和队列/1.栈的基本概念和基本操作.md +++ b/docs/manuscripts/ds/栈和队列/1.栈的基本概念和基本操作.md @@ -1,14 +1,3 @@ - - - - # 基本概念和基本操作 `栈`： 只允许在一端进行插入或者删除操作的**线性表**，`后进先出的线性表`。 diff --git a/docs/manuscripts/ds/栈和队列/2.栈的顺序存储结构.md b/docs/manuscripts/ds/栈和队列/2.栈的顺序存储结构.md index af301b4..22b7ef4 100644 --- a/docs/manuscripts/ds/栈和队列/2.栈的顺序存储结构.md +++ b/docs/manuscripts/ds/栈和队列/2.栈的顺序存储结构.md @@ -1,14 +1,3 @@ - - - - # 栈的顺序存储结构 diff --git a/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md b/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md index 0e82361..b02c445 100644 --- a/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md +++ b/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md @@ -1,12 +1,3 @@ - - # 栈的链式存储结构 diff --git a/docs/manuscripts/ds/栈和队列/4.队列的基本概念和操作.md b/docs/manuscripts/ds/栈和队列/4.队列的基本概念和操作.md index 0a25b4d..1687609 100644 --- a/docs/manuscripts/ds/栈和队列/4.队列的基本概念和操作.md +++ b/docs/manuscripts/ds/栈和队列/4.队列的基本概念和操作.md @@ -1,12 +1,3 @@ - - # 队列的基本概念和操作 diff --git a/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md b/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md index 99cbfaf..c76edc1 100644 --- a/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md +++ b/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md @@ -1,13 +1,3 @@ - - - # 队列的顺序存储结构 diff --git a/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md b/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md index 67a1150..2c53a1c 100644 --- a/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md +++ b/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md @@ -1,12 +1,3 @@ - - # 队列的链式存储结构 diff --git a/docs/manuscripts/ds/栈和队列/7.栈和队列的应用.md b/docs/manuscripts/ds/栈和队列/7.栈和队列的应用.md index 7851862..e2fad63 100644 --- a/docs/manuscripts/ds/栈和队列/7.栈和队列的应用.md +++ b/docs/manuscripts/ds/栈和队列/7.栈和队列的应用.md @@ -1,14 +1,3 @@ - - - - # 栈和队列的应用 diff --git a/docs/manuscripts/ds/栈和队列/8.特殊矩阵的压缩存储.md b/docs/manuscripts/ds/栈和队列/8.特殊矩阵的压缩存储.md index cca5a3c..48d9597 100644 --- a/docs/manuscripts/ds/栈和队列/8.特殊矩阵的压缩存储.md +++ b/docs/manuscripts/ds/栈和队列/8.特殊矩阵的压缩存储.md @@ -1,12 +1,3 @@ - - # 特殊矩阵的压缩存储 diff --git a/docs/manuscripts/ds/栈和队列/readme.md b/docs/manuscripts/ds/栈和队列/readme.md index 668b8de..beded74 100644 --- a/docs/manuscripts/ds/栈和队列/readme.md +++ b/docs/manuscripts/ds/栈和队列/readme.md @@ -1,13 +1,3 @@ - - - # 栈和队列 ### 主要内容 diff --git a/scripts/deploy.sh b/scripts/deploy.sh index 75f1222..f00a1c6 100644 --- a/scripts/deploy.sh +++ b/scripts/deploy.sh @@ -120,7 +120,6 @@ deploy_to_github(){ git config --list - # if you are deploying to https://.github.io # git push -f git@github.com:/.github.io.git master # if you are deploying to https://.github.io/ From 1f3e23fa742916fbbae7120a7470056c927a6a0f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E6=9C=80=E8=BF=91=E5=9C=A8=E5=AD=A6=E6=A1=8C=E7=90=83?= Date: Wed, 30 Aug 2023 17:38:10 +0800 Subject: [PATCH 2/5] feat: test --- docs/manuscripts/note-map/cn-map.md | 12 +++++++++++- 1 file changed, 11 insertions(+), 1 deletion(-) diff --git a/docs/manuscripts/note-map/cn-map.md b/docs/manuscripts/note-map/cn-map.md index 2bab52f..0a0d2af 100644 --- a/docs/manuscripts/note-map/cn-map.md +++ b/docs/manuscripts/note-map/cn-map.md @@ -1,2 +1,12 @@ -# 计算机网络 \ No newline at end of file +# 计算机网络 + +