From 483dcba3c4cf7dabc12ee8e62472b07a9a0ee73a Mon Sep 17 00:00:00 2001
From: "142vip.cn" <fairy_408@2925.com>
Date: Sat, 18 Nov 2023 14:19:50 +0800
Subject: [PATCH] =?UTF-8?q?feat:=20=E6=9B=B4=E6=96=B0=E5=BF=BD=E7=95=A5?=
 =?UTF-8?q?=E6=96=87=E4=BB=B6=E3=80=81=E9=93=BE=E6=8E=A5=E5=9C=B0=E5=9D=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .gitignore                                    | 20 +------------------
 README.md                                     |  6 +++---
 .../ds/栈和队列/3.栈的链式存储结构.md         |  8 ++++----
 .../ds/栈和队列/5.队列的顺序存储结构.md       | 20 +++++++++----------
 .../ds/栈和队列/6.队列的链式存储结构.md       | 16 +++++++--------
 docs/manuscripts/ds/线性表/2.顺序表示.md      | 12 +++++------
 docs/manuscripts/ds/线性表/3.链式表示.md      | 12 +++++------
 docs/readme.md                                |  2 +-
 8 files changed, 39 insertions(+), 57 deletions(-)

diff --git a/.gitignore b/.gitignore
index 831c57d..a20d5fc 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,40 +1,22 @@
-# Logs
 logs
 *.log
 .vscode
 .vscode/*
 */.DS_Store
 .DS_Store
-*/.vscode
 .idea
-# Coverage directory used by tools like istanbul
 coverage
-*.lcov
-# nyc test coverage
-.nyc_output
-# Dependency directories
-node_modules/
-jspm_packages/
-# TypeScript v1 declaration files
+node_modules
 typings/
-# Optional npm cache directory
 .npm
-# Output of 'npm pack'
 *.tgz
-# parcel-bundler cache (https://parceljs.org/)
 .cache
-# Next.js build output
 .next
 .nuxt
 dist
-# Gatsby files
 .cache/
-# vuepress build output
-# .vuepress/dist
 docs/.vuepress/.cache/
 docs/.vuepress/.temp/
 docs/.vuepress/dist/
-# TernJS port file
-.tern-port
 /.husky/
 /.vercel/
diff --git a/README.md b/README.md
index f15ce5e..dae2386 100644
--- a/README.md
+++ b/README.md
@@ -327,14 +327,14 @@
 
 <div style="text-align: center;margin: 10px" id="we-media-container">
     <div align="center" >
-            <img src="https://cdn.statically.io/gh/142vip/cdn_service@main/media/fairy-sister-450x450.jpg"
+            <img src="https://cdn.statically.io/gh/142vip/cdn_service@main/media/chu-fan-code-450x450.png"
                 width="200px"
                 style="margin:5px"
-                title="欢迎关注公众号:Rong姐姐好可爱" alt="关注公众号"/>
+                title="欢迎关注微信公众号：储凡" alt="关注微信公众号：储凡"/>
             <img src="https://cdn.statically.io/gh/142vip/cdn_service@main/media/chu-fan-443-650x650.jpg"
                 width="200px"
                 style="margin:5px"
-                title="欢迎添加微信：chufan443 " alt="联系作者"/>
+                title="欢迎添加微信：chufan443 " alt="添加微信：chufan443，联系作者"/>
     </div>
     <div style="text-align: center;padding: 5px" align="center">
         <a
diff --git a/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md b/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md
index 3d644a3..876dc59 100644
--- a/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md
+++ b/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md
@@ -63,9 +63,9 @@ typedef struct LinkStack
 /*
  * @Description: 基于单链表链栈的进栈操作
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-03-04 07:36:04
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2020-03-04 11:39:16
  */
 bool linkStackPushNode(LinkStack* linkStack,int e){
@@ -100,9 +100,9 @@ bool linkStackPushNode(LinkStack* linkStack,int e){
 /*
  * @Description: 基于单链表链栈的出栈操作
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-03-04 23:38:04
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2020-03-04 23:39:16
  */
 bool linkStackPopNode(LinkStack* linkStack,int *e){
diff --git a/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md b/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md
index cb37a6b..0e9871d 100644
--- a/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md
+++ b/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md
@@ -181,9 +181,9 @@ int DeLoopQueue(SqQueue &Q, ElemType &x){
 /*
  * @Description: 循环队列初始化，队列为空
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2019-09-27 14:17:28
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-03-18 22:15:06
  */
 void InitLoopQueque(&Q){
@@ -197,9 +197,9 @@ void InitLoopQueque(&Q){
 /*
  * @Description: 判断循环队列是否为空
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2019-09-27 14:17:28
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-03-18 22:15:06
  */
 bool isEmpatyLoopQueue(Q){
@@ -221,9 +221,9 @@ bool isEmpatyLoopQueue(Q){
 /*
  * @Description: 循环队列元素入队
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2019-09-27 14:17:28
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-03-18 22:15:06
  */
 bool EnLoopQueue(SqQueue &Q, ElemType x){
@@ -253,9 +253,9 @@ bool EnLoopQueue(SqQueue &Q, ElemType x){
 /*
  * @Description: 循环队列元素出队
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2019-09-27 14:17:28
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-03-18 20:32:18
  */
 bool DeLoopQueue(SqQueue &Q, ElemType &x){
@@ -287,9 +287,9 @@ bool DeLoopQueue(SqQueue &Q, ElemType &x){
 /*
  * @Description: 获取循环队列队头元素
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2019-09-27 14:17:28
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-03-18 20:15:33
  */
 bool GetLoopQueueHead(SqQueue &Q, ElemType &x){
diff --git a/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md b/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md
index c46c99a..daa3acb 100644
--- a/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md
+++ b/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md
@@ -73,9 +73,9 @@ typedef struct{
 /*
  * @Description: 链式队列初始化
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-06-27 14:17:28
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-02-18 22:15:06
  */
 voide InitLinkQueue(LinkQueue &Q){
@@ -99,9 +99,9 @@ voide InitLinkQueue(LinkQueue &Q){
 /*
  * @Description: 判断链式队列是否为空
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-06-27 14:24:22
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-02-16 22:15:06
  */
 bool IsEmptyLinkQueue(LinkQueue Q){
@@ -121,9 +121,9 @@ bool IsEmptyLinkQueue(LinkQueue Q){
 /*
  * @Description: 链式队列入队操作
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-06-46 14:17:28
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-02-18 22:15:06
  */
 void EnLinkQueue(LinkQueue &Q, ElemType x){
@@ -151,9 +151,9 @@ void EnLinkQueue(LinkQueue &Q, ElemType x){
 /*
  * @Description: 链式队列出队操作
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-05-18 11:25:28
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2021-02-22 06:15:06
  */
 bool DeLinkQueue(LinkQueue &Q, ElemType &x){
diff --git a/docs/manuscripts/ds/线性表/2.顺序表示.md b/docs/manuscripts/ds/线性表/2.顺序表示.md
index 1ed2e8e..4f9fbc3 100644
--- a/docs/manuscripts/ds/线性表/2.顺序表示.md
+++ b/docs/manuscripts/ds/线性表/2.顺序表示.md
@@ -92,9 +92,9 @@ L.data=new ElemType[InitSize];
 /*
  * @Description: 顺序表的插入操作
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-02-23 07:48:26
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2020-02-23 07:48:26
  */
 bool ListInsert(SqList &L, int i, ElemType e){
@@ -154,9 +154,9 @@ bool ListInsert(SqList &L, int i, ElemType e){
 /*
  * @Description: 顺序表的删除操作
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-02-23 07:48:26
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2020-02-23 07:48:26
  */
 bool ListDelete(SqList &L, int i, ElemType &e){
@@ -214,9 +214,9 @@ bool ListDelete(SqList &L, int i, ElemType &e){
 /*
  * @Description: 顺序表的按值查找（顺序查找）
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-02-23 07:48:26
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2020-02-23 07:48:26
  */
 int LocateElem(SqList L,ElemType e){
diff --git a/docs/manuscripts/ds/线性表/3.链式表示.md b/docs/manuscripts/ds/线性表/3.链式表示.md
index d062167..62a7bc9 100644
--- a/docs/manuscripts/ds/线性表/3.链式表示.md
+++ b/docs/manuscripts/ds/线性表/3.链式表示.md
@@ -89,9 +89,9 @@ typeof struct LNode{
 /*
  * @Description: 单链表头插法创建
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-03-04 23:38:04
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2020-03-04 23:39:16
  */
 LinkList CreateListWithStartNode(LinkList &L){
@@ -139,9 +139,9 @@ LinkList CreateListWithStartNode(LinkList &L){
 /*
  * @Description: 单链表尾插法创建
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-03-04 23:38:04
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2020-03-04 23:39:16
  */
 LinkList CreateListWithEndNode(LinkList &L){
@@ -195,9 +195,9 @@ LinkList CreateListWithEndNode(LinkList &L){
 /*
  * @Description: 单链表按序号查找
  * @Version: Beta1.0
- * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Author: 微信公众号：储凡
  * @Date: 2020-03-04 23:38:04
- * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditors: 微信公众号：储凡
  * @LastEditTime: 2020-03-04 23:39:16
  */
 LNode *GetElem(LinkList L,int i){
diff --git a/docs/readme.md b/docs/readme.md
index 8fdc927..dafc6d3 100644
--- a/docs/readme.md
+++ b/docs/readme.md
@@ -97,7 +97,7 @@ yarn run dev
 
 - 稳定版： <https://408.142vip.cn>
 
-> 网站无法访问时，合理使用魔法通过科学上网访问第三方托管平台
+> 网站无法访问时，合理使用魔法、通过科学上网访问第三方托管平台
 
 - Github： <https://142vip.github.io/408CSFamily>
 - Netlify： <https://408-family.netlify.app>