feat: 文档内容更新，md文档新增固定链接

2026-02-02 18:20:26 +08:00 · 2023-10-31 19:08:42 +08:00
parent 56cb1dee37
commit 564c3e06d6
128 changed files with 1058 additions and 307 deletions
--- a/.dockerignore
+++ b/.dockerignore
@@ -1,4 +1,3 @@
 node_modules
 .idea
 .github
-.husky
--- a/README.md
+++ b/README.md
@@ -1,3 +1,5 @@
+<!-- #region quick-start -->
+
 <div align="center">
 <p>
  <img alt="408Logo图片" width="240" src="https://cdn.statically.io/gh/142vip/cdn_service@main/doc_book/408/408_logo.png" style="text-align: center;">
@@ -28,7 +30,21 @@
 </div>
 </div>

-### 在线浏览
+## 写最前面
+
+`408CSFamily` 我的理解是：408计算机专业课”全家桶“，而408相信考研er都知道计算机考研专业课代码；在最新的高校计算机研究生招考中，已经越来越多的学校改考408。可见408所涉及到的专业课举足轻重的地位；不论是在考研或者找工作，我相信408的专业基础必定是难以避免的，所以话不多说、形势复杂，唯一能做的就是不停的学习、巩固基础知识，加油！
+
+本仓库收录的大部分内容将来源我自己的学习输出和相关资料的整理，
+将会站在上班族的角度进行整理、输出。若有任何疑惑和问题，
+欢迎在仓库集中`PR`或`ISSUES`提出。
+
+**阅读之前必看：**
+
+- **大家善用快捷键Ctrl+F，没有效访问链接的代表尚未完成**
+- 注意学科学习顺序，建议：`数据结构` --> `操作系统`、`计算机组成原理` --> `计算机网络`
+- 学习切忌浮于表面，戒骄戒躁。408考试知识点多、杂，非常容易忘，**抓大放小、先易后难、反复多次**
+
+## 在线浏览

 - 稳定版： <https://408.142vip.cn>

@@ -38,70 +54,45 @@
 - Netlify： <https://408-family.netlify.app>
 - Vercel： <https://408-family.vercel.app>

-## 写最前面
+[//]: # (## 思维导图【MD文档版本】)
+[//]: # (- [数据结构]&#40;./manuscripts/数据结构/数据结构和算法.md&#41;)
+[//]: # (- 计算机组成原理（TBD）)
+[//]: # (- 操作系统（TBD）)
+[//]: # (- 计算机网络（TBD）)

-`408CSFamily` 我的理解是：408计算机专业课”全家桶“，而408相信考研er都知道计算机考研专业课代码；在最新的高校计算机研究生招考中，已经越来越多的学校改考408。可见408所涉及到的专业课举足轻重的地位；不论是在考研或者找工作，我相信408的专业基础必定是难以避免的，所以话不多说、形势复杂，唯一能做的就是不停的学习、巩固基础知识，加油！
+## 学习资料

-本仓库收录的大部分内容将来源我自己的学习输出和相关资料的整理，将会站在上班族的角度进行分类、输出，若有任何疑惑和问题，欢迎在github仓库集中pr或issues提出
-
-**阅读之前必看：**
-
-1. 长期更新、维护
-2. 建议结合思维导图进行学习
-
-### 思维导图【MD文档版本】
-
-> 主要是关键知识，更新优化中...
-
- [数据结构](./manuscripts/数据结构/数据结构和算法.md)
- 计算机组成原理（TBD）
- 操作系统（TBD）
- 计算机网络（TBD）
-
-## 电子书PDF
-
-### 王道
+### 电子书PDF - 王道

 - 数据结构2019: <https://pan.baidu.com/s/18x8AIfOkZxz197eY7HLRMg>  密码: euja
-
 - 计算机组成原理2019: <https://pan.baidu.com/s/1DiOBJMt9ZnZ6GK4CRCETJg>  密码: wic5
-
 - 计算机网络2019: <https://pan.baidu.com/s/1mmIZDugwY5YyytzIJoGQFw>  密码: dpkb
-
 - 操作系统2019: <https://pan.baidu.com/s/1gzuUqq09xqi8wQ8JJRF69g>  密码: o9b3

-## 学习视频
+### 学习视频

-> 不是王道工作人员，不做任何推销，只是感觉看书不太行的话还是得找找视频辅助下，就发现了王道视频。
-> 唯一要推销的可能是我的B站：**[Rong姐姐好可爱](https://space.bilibili.com/350937042)**
->
-> 补充：视频都是王道官方的，我自己有时也会用这个，如果链接失效可以去B站搜搜哈
+> **不是王道工作人员，不做任何推销**，只是感觉看书不太行的话还是得找找视频辅助下，就发现了王道官方视频，我自己有时也会用这个，如果链接失效可以去B站搜！

 - [数据结构](https://www.bilibili.com/video/BV1b7411N798)
 - [计算机组成原理](https://www.bilibili.com/video/BV1BE411D7ii)
 - [操作系统](https://www.bilibili.com/video/BV1YE411D7nH)
 - [计算机网络](https://www.bilibili.com/video/BV19E411D78Q)

-## 大纲目录（善用Ctrl+F）
+## 数据结构

-**注意：没有链接的，可以在仓库找找，只是选择性进行博客和公众号发表**
-
-### 数据结构
-
-> 参考资料
+> 参考资料：
 >
 > - 《数据结构》 .
 > - 《大话数据结构》.
-> - 《数据结构与算法景点问题解析》 第二版  Narasimha Karumanchi著.
 > - 《计算机网络-王道考研》 2019 王道论坛著.

-#### 基础入门
+### 基础入门

 - [基础概念](https://mp.weixin.qq.com/s/M8MOCVnbVxQ3GRuxRaEKIg)
 - [数据结构三要素](https://mp.weixin.qq.com/s/7sCoHDFtI-Qp0wBcvMH6kQ)
 - [算法与算法评价](https://mp.weixin.qq.com/s/58fBAwoyg2Ali-HqOJ6t9g)

-#### 线性表
+### 线性表

 - [基础概念和基本操作](https://mp.weixin.qq.com/s/3e5LX9HbnjfT980zV3veXA)
 - [线性表的顺序表示](https://mp.weixin.qq.com/s/gaXmF3tqZxxFXhhDyPZv-A)
@@ -113,25 +104,25 @@
 - [存储结构的选取](https://mp.weixin.qq.com/s?__biz=MzU3MTUxOTIwMw==&amp;mid=2247485549&amp;idx=1&amp;sn=4b7091696c40874a7dcfc682ca18db61&amp;chksm=fcdfb1e1cba838f7e611341fe3b6f3c45fc6efcdce18e79be244a349c87a8e6abcbbd33c250c&token=1697862929&lang=zh_CN#rd)
 - [零碎知识补充](https://mp.weixin.qq.com/s?__biz=MzU3MTUxOTIwMw==&amp;mid=2247485549&amp;idx=2&amp;sn=5282cd006b6c33e4bfe992298602e053&amp;chksm=fcdfb1e1cba838f743a335bad530cf415eef57a417b807257d8ed6983047c2d57d5552b34cb0&token=1697862929&lang=zh_CN#rd)

-#### 栈
+### 栈

 - 基本概念和操作
 - 顺序存储结构
 - 链式存储结构

-#### 队列
+### 队列

 - 基本概念和操作
 - 顺序存储结构
 - 链式存储结构

-#### 串
+### 串

 - 基本概念
 - 简单的模式匹配
 - KMP算法

-#### 树与二叉树
+### 树与二叉树

 - 基本概念
 - 二叉树
@@ -140,14 +131,14 @@
 - 树和森林
 - 树的应用

-#### 图论
+### 图论

 - 基本概念
 - 图的存储
 - 图的遍历
 - 图的应用

-#### 查找
+### 查找

 - 基本概念
 - 顺序查找
@@ -155,7 +146,7 @@
 - B树和B+树
 - 散列表

-#### 排序
+### 排序

 - 基本概念
 - 插入排序
@@ -165,87 +156,87 @@
 - 基数排序
 - 外部排序

-### 计算机操作系统
+## 计算机操作系统

-> 参考资料
+> 参考资料：
 >
 > - 《计算机操作系统》 第四版  汤小丹、梁红兵、汤子瀛著
 > - 《操作系统-王道考研》 2019 王道论坛

-#### 系统概述
+### 系统概述

 - 引论
 - 发展和分类
 - 运行环境
 - 体系结构

-#### 进程管理
+### 进程管理

 - 进程和线程
 - 处理机调度
 - 进程同步
 - 死锁

-#### 内存管理
+### 内存管理

 - 引论
 - 虚拟内存
 - 一些总结

-#### 文件管理
+### 文件管理

 - 基本概念
 - 文件系统
 - 磁盘管理
 - 一些总结

-#### 输入、输出管理
+### 输入、输出管理

 - 基本概述
 - 核心子系统
 - 高速缓存和缓冲区
 - 一些总结

-### 计算机组成原理
+## 计算机组成原理

-> 参考资料
+> 参考资料：
 >
 > - 《计算机组成原理》 第二版  唐朔飞
 > - 《计算机组成原理-王道考研》 2019 王道论坛

-#### 概述
+### 概述

-#### 数据的表示和运算
+### 数据的表示和运算

-#### 存储系统
+### 存储系统

-#### 指令系统
+### 指令系统

-#### 中央处理器
+### 中央处理器

-#### 总线
+### 总线

-#### 输入输出系统
+### 输入输出系统

-### 计算机网络
+## 计算机网络

-> 参考资料
+> 参考资料：
 >
 > - 《计算机网络-第七版》  谢希仁著.
 > - 《计算机网络-王道考研》 2019 王道论坛.

-#### 体系机构
+### 体系机构

 - 基本介绍
 - 体系结构与参考模型

-#### 物理层
+### 物理层

 - 通信基础
 - 传输介质
 - 物理层设备

-#### 数据链路层
+### 数据链路层

 - 基本功能
 - 组帧
@@ -256,7 +247,7 @@
 - 广域网
 - 通信设备

-#### 网络层
+### 网络层

 - 基本功能
 - 路由算法
@@ -266,13 +257,13 @@
 - IP组播&移动IP
 - 网络层设备

-#### 传输层
+### 传输层

 - 提供的服务
 - UDP协议
 - TCP协议

-#### 应用层
+### 应用层

 - 应用模型
 - DNS
@@ -280,26 +271,33 @@
 - 电子邮件
 - HTTP协议

+<!-- #endregion quick-start -->
+
+[//]: # (宣传内容)
+<!-- #region we-media -->
+
+## 提交记录
+
 ## 赞赏列表

-以下排名不分先后!  [传送门→]() **赞赏过的一定要微信跟我说呀！！！！！！**
+以下排名不分先后!  **赞赏过的一定要微信跟我说呀！！！！！！**

 <div>
  <a href="https://github.com/ChiefPing" target="_blank" style="margin: 5px">
-    <img alt="ChiefPing" src="https://avatars2.githubusercontent.com/u/34122068?s=460&v=4" width="50px" style="brder-radius:5px;"/>
+    <img src="https://avatars2.githubusercontent.com/u/34122068?s=460&v=4" width="50px" style="brder-radius:5px;"/>
  </a>
   <a href="https://github.com/xiaoliuxin" target="_blank" style="margin: 5px">
-    <img alt="xiaoliuxin" src="https://avatars2.githubusercontent.com/u/60652527?s=460&v=4"  style="border-radius:5px;"  width="50px"/>
+    <img src="https://avatars2.githubusercontent.com/u/60652527?s=460&v=4"  style="border-radius:5px;"  width="50px"/>
  </a>
 </div>

 ## 赞助商

-**以下排名不分先后! 还木有收到赞助，哈哈哈，先留坑**
+以下排名不分先后! 还木有收到赞助，哈哈哈，先留坑

 ## 贡献

-感谢向仓库提交mr的所有开发者
+> 感谢向仓库提交PR的所有开发者

 [![contributors](https://contrib.rocks/image?repo=142vip/408CSFamily)](https://github.com/142vip/408CSFamily/graphs/contributors)

@@ -318,11 +316,11 @@
        <table style="border:none;cell-padding:0; cell-spacing:0;border-collapse:collapse;" border="0">
            <img src="https://cdn.statically.io/gh/142vip/cdn_service@main/media/fairy-sister-450x450.jpg"
                width="250px"
-    style="margin:10px"
+                style="margin:10px"
                title="欢迎关注公众号:Rong姐姐好可爱" alt="关注公众号"/>
            <img src="https://cdn.statically.io/gh/142vip/cdn_service@main/media/chu-fan-443-650x650.jpg"
                width="250px"
-    style="margin:10px"
+                style="margin:10px"
                title="欢迎添加微信：chufan443 " alt="联系作者"/>
        </table>
    </div>
@@ -374,7 +372,24 @@
            style="margin: 5px;width: 24px;height: 24px;">
        </a>
    </div>
+    <div align="center">
+        <div id="">
+             <a href="https://github.com/mmdapl" target="_blank">
+              <img alt="作者: 储凡" src="https://img.shields.io/badge/Author-Chu·Fan-8A2BE2.svg?style=for-the-badge" style="text-align: center;">
+             </a>
+        </div>
+        <div style="padding: 5px">
+             <a href="https://app.netlify.com/sites/408-family/deploys" target="_blank" style="padding: 5px">
+              <img alt="Netlify" src="https://api.netlify.com/api/v1/badges/75a7251a-f873-4aff-b387-6449ca241ef7/deploy-status">
+             </a>
+             <a href="https://vercel.com/142vip/408/deployments" target="_blank" style="padding: 5px">
+              <img alt="Vercel" src="https://therealsujitk-vercel-badge.vercel.app/?app=408">
+             </a>
+        </div>
+    </div>
 </div>

-交流/加群/互看朋友圈
-当然：**聊天 /提问 /建议 /提需求** 可以在本公众号直接**私信**，后台可以看到，有时间即会回复，偶尔的延迟和疏漏还请小伙伴们谅解，蟹蟹。
+交流/加群/互看朋友圈，
+当然：**聊天/提问/建议/提需求** 可以在公众号直接**私信**，后台可以看到。有时间即会回复，偶尔的延迟和疏漏还请小伙伴们谅解，蟹蟹。
+
+<!-- #endregion we-media -->
--- a/docs/.vuepress/config/navbar.ts
+++ b/docs/.vuepress/config/navbar.ts
@@ -6,11 +6,10 @@ export const navbar = [
    text: '首页',
    link: '/'
  },
-  // {
-  //   text: "数据结构",
-  //   link: "/manuscripts/ds"
-  // },
-  "/manuscripts/ds",
+  {
+    text: "数据结构",
+    link: "/manuscripts/ds"
+  },
  {
    text: "操作系统",
    link: "/manuscripts/os"
@@ -28,13 +27,39 @@ export const navbar = [
    text: '思维导图',
    link: "/manuscripts/mark-map",
  },
-  // http://localhost:4200/mark-map/job-poster-bytedance.html
  {
-    text: "网站",
+    text: "了解更多",
    children: [
-      "/big-event-history.md",
-      "/changelog.md",
-      "/wechat-list.md"
-    ]
+      {
+        text: '变更记录',
+        link: '/manuscripts/changelog.md'
+      },
+      {
+        text: '网站动态',
+        link: '/manuscripts/big-event-history.md'
+      },
+      {
+        text: "自媒体",
+        children: [
+          {
+            text: "公众号文章",
+            link: "/manuscripts/wechat-list.md"
+          },
+        ]
+      },
+      {
+        text: "外链",
+        children: [
+          // {
+          //   text: '常用网站',
+          //   link: '/manuscripts/frequent-site-link.md'
+          // },
+          {
+            text: "RoadMap计划",
+            link: "https://142vip-cn.feishu.cn/share/base/view/shrcnpso8R4vCid01wmg66hFjae"
+          }
+        ]
+      },
+    ],
  },
 ];
--- a/docs/.vuepress/config/theme.config.ts
+++ b/docs/.vuepress/config/theme.config.ts
@@ -108,8 +108,10 @@ export default {
        // 自定义对齐
        align: true,
      },
+      // 不自动生成readme目录
+      autoCatalog: false,
+      // 参考：https://theme-hope.vuejs.press/zh/guide/markdown/components.html
      components: {
-        // 插件选项
        components: [
          "ArtPlayer",
          "AudioPlayer",
--- a/docs/.vuepress/public/mark-map/cn-map.html
+++ b/docs/.vuepress/public/mark-map/cn-map.html
@@ -16,11 +16,11 @@
  height: 100vh;
 }
 </style>
-<link rel="stylesheet" href="https://unpkg.com/markmap-toolbar@0.15.4/dist/style.css">
+<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/markmap-toolbar@0.15.4/dist/style.css">
 </head>
 <body>
 <svg id="mindmap"></svg>
-<script src="https://unpkg.com/d3@7.8.5/dist/d3.min.js"></script><script src="https://unpkg.com/markmap-view@0.15.4/dist/browser/index.js"></script><script src="https://unpkg.com/markmap-toolbar@0.15.4/dist/index.js"></script><script>(r => {
+<script src="https://cdn.jsdelivr.net/npm/d3@7.8.5/dist/d3.min.js"></script><script src="https://cdn.jsdelivr.net/npm/markmap-view@0.15.4/dist/browser/index.js"></script><script src="https://cdn.jsdelivr.net/npm/markmap-toolbar@0.15.4/dist/index.js"></script><script>(r => {
          setTimeout(r);
        })(() => {
  const {
@@ -35,6 +35,6 @@
 })</script><script>((getMarkmap, getOptions, root, jsonOptions) => {
          const markmap = getMarkmap();
          window.mm = markmap.Markmap.create('svg#mindmap', (getOptions || markmap.deriveOptions)(jsonOptions), root);
-        })(() => window.markmap,null,{"type":"heading","depth":0,"payload":{"lines":[0,1]},"content":"计算机网络","children":[{"type":"heading","depth":1,"payload":{"lines":[4,5]},"content":"体系结构","children":[]},{"type":"heading","depth":1,"payload":{"lines":[6,7]},"content":"物理层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[8,9]},"content":"数据链路层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[10,11]},"content":"网络层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[12,13]},"content":"传输层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[14,15]},"content":"应用层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[16,17]},"content":"一些总结","children":[]}]},null)</script>
+        })(() => window.markmap,null,{"type":"heading","depth":0,"payload":{"lines":[1,2]},"content":"计算机网络","children":[{"type":"heading","depth":1,"payload":{"lines":[5,6]},"content":"体系结构","children":[]},{"type":"heading","depth":1,"payload":{"lines":[7,8]},"content":"物理层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[9,10]},"content":"数据链路层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[11,12]},"content":"网络层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[13,14]},"content":"传输层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[15,16]},"content":"应用层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[17,18]},"content":"一些总结","children":[]}]},null)</script>
 </body>
 </html>
--- a/docs/.vuepress/public/mark-map/ds-map.html
+++ b/docs/.vuepress/public/mark-map/ds-map.html
--- a/docs/.vuepress/public/mark-map/os-map.html
+++ b/docs/.vuepress/public/mark-map/os-map.html
@@ -35,6 +35,6 @@
 })</script><script>((getMarkmap, getOptions, root, jsonOptions) => {
          const markmap = getMarkmap();
          window.mm = markmap.Markmap.create('svg#mindmap', (getOptions || markmap.deriveOptions)(jsonOptions), root);
-        })(() => window.markmap,null,{"type":"heading","depth":0,"payload":{"lines":[0,1]},"content":"操作系统","children":[{"type":"heading","depth":1,"payload":{"lines":[4,5]},"content":"引论","children":[]},{"type":"heading","depth":1,"payload":{"lines":[6,7]},"content":"进程管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[8,9]},"content":"内存管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[10,11]},"content":"一些总结","children":[]},{"type":"heading","depth":1,"payload":{"lines":[12,13]},"content":"I/O管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[14,15]},"content":"文件管理","children":[]}]},null)</script>
+        })(() => window.markmap,null,{"type":"heading","depth":0,"payload":{"lines":[1,2]},"content":"操作系统","children":[{"type":"heading","depth":1,"payload":{"lines":[5,6]},"content":"引论","children":[]},{"type":"heading","depth":1,"payload":{"lines":[7,8]},"content":"进程管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[9,10]},"content":"内存管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[11,12]},"content":"一些总结","children":[]},{"type":"heading","depth":1,"payload":{"lines":[13,14]},"content":"I/O管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[15,16]},"content":"文件管理","children":[]}]},null)</script>
 </body>
 </html>
--- a/docs/.vuepress/styles/config.scss
+++ b/docs/.vuepress/styles/config.scss
@@ -7,4 +7,4 @@ $code-light-them: "coldark-cold";
 $code-dark-theme: "atom-dark";

 // 主题色
-$theme-colors: #2196f3, #f26d6d, #3eaf7c, #fb9b5f;
+//$theme-colors: #2196f3, #f26d6d, #3eaf7c, #fb9b5f;
--- a/docs/.vuepress/styles/index.scss
+++ b/docs/.vuepress/styles/index.scss
@@ -1,18 +1,5 @@
 /*  此处自定义样式，对主题进行覆盖 */

-//首页导航按钮
-.actions > a {
-  margin-left: 5px;
-  margin-right: 5px;
-}
-
-// 隐藏 全文搜索
-.DocSearch-Logo {
-  // display:none;不占位隐藏
-  visibility: hidden; // 占位隐藏
-}
-
-
 // 全站主题色
 :root {
  // brand colors
@@ -90,11 +77,6 @@
  --homepage-width: 960px;
 }

-// plugin-back-to-top
-.back-to-top {
-  --back-to-top-color: var(--c-brand);
-  --back-to-top-color-hover: var(--c-brand-light);
-}

 // plugin-docsearch
 .DocSearch {
@@ -124,10 +106,6 @@
  --medium-zoom-bg-color: var(--c-bg);
 }

-// plugin-nprogress
-#nprogress {
-  --nprogress-color: var(--c-brand);
-}

 // plugin-pwa-popup
 .pwa-popup {
@@ -150,4 +128,3 @@
  --search-item-text-color: var(--c-text-lighter);
  --search-item-focus-bg-color: var(--c-bg-light);
 }
-
--- a/docs/.vuepress/styles/palette.scss
+++ b/docs/.vuepress/styles/palette.scss
@@ -1,6 +1,7 @@
 // 主题色
-$theme-color: #2980B9;
-$sidebar-width: 20rem;
-$sidebar-mobile-width: 16rem;
-$content-width: 75rem;
-$home-page-width:80rem;
+//$theme-color: #2980B9;
+$theme-color: #4979ff;
+//$sidebar-width: 20rem;
+//$sidebar-mobile-width: 16rem;
+//$content-width: 75rem;
+$home-page-width: 80rem;
--- a/docs/manuscripts/big-event-history.md
+++ b/docs/manuscripts/big-event-history.md
@@ -1,4 +1,9 @@
-# 大事记
+---
+title: 网站动态
+permalink: /manuscripts/big-event-history.html
+---
+
+# 网站动态

 > 有时间再梳理梳理吧....

--- a/docs/manuscripts/changelog.md
+++ b/docs/manuscripts/changelog.md
@@ -1,8 +1,12 @@
+---
+title: 变更记录
+permalink: /manuscripts/changelog.html
+---
 # 变更记录

 该文件包含 `408CSFamily` 仓库和网站所有显着更改。

-<!-- @include: ../CHANGELOG.md#recent-alpha -->
+<!-- @include: ../../CHANGELOG.md#recent-alpha -->

 ## 更多

--- a/docs/manuscripts/cn/传输层/1.提供的服务.md
+++ b/docs/manuscripts/cn/传输层/1.提供的服务.md
@@ -1,3 +1,8 @@
+---
+title: 提供的服务
+permalink: /manuscripts/cn/trans-port-layer/provider-service.html
+---
+
 # 提供的服务

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/传输层/2.UDP协议.md
+++ b/docs/manuscripts/cn/传输层/2.UDP协议.md
@@ -1,3 +1,7 @@
+---
+title: UDP协议
+permalink: /manuscripts/cn/trans-port-layer/udp.html
+---
 # UDP协议

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/传输层/3.TCP协议.md
+++ b/docs/manuscripts/cn/传输层/3.TCP协议.md
@@ -1,3 +1,7 @@
+---
+title: TCP协议
+permalink: /manuscripts/cn/trans-port-layer/tcp.html
+---
 # TCP协议

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/传输层/4.总结.md
+++ b/docs/manuscripts/cn/传输层/4.总结.md
@@ -1,3 +1,8 @@
+---
+title: 一些总结
+permalink: /manuscripts/cn/trans-port-layer/summary.html
+---
+
 # 总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/体系结构/1.引论.md
+++ b/docs/manuscripts/cn/体系结构/1.引论.md
@@ -1,3 +1,8 @@
+---
+title: 基本介绍
+permalink: /manuscripts/cn/architecture/introduce.html
+---
+
 # 基本介绍

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/体系结构/2.体系结构与参考模型.md
+++ b/docs/manuscripts/cn/体系结构/2.体系结构与参考模型.md
@@ -1,3 +1,8 @@
+---
+title: 体系结构与参考模型
+permalink: /manuscripts/cn/architecture/reference-model.html
+---
+
 # 体系结构与参考模型

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/应用层/1.应用模型.md
+++ b/docs/manuscripts/cn/应用层/1.应用模型.md
@@ -1,3 +1,8 @@
+---
+title: 应用模型
+permalink: /manuscripts/cn/application-layer/application-model.html
+---
+
 # 应用模型

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/应用层/2.DNS.md
+++ b/docs/manuscripts/cn/应用层/2.DNS.md
@@ -1,3 +1,7 @@
+---
+title: DNS
+permalink: /manuscripts/cn/application-layer/dns.html
+---
 # DNS

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/应用层/3.FTP.md
+++ b/docs/manuscripts/cn/应用层/3.FTP.md
@@ -1,3 +1,7 @@
+---
+title: FTP
+permalink: /manuscripts/cn/application-layer/ftp.html
+---
 # FTP

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/应用层/4.HTTP.md
+++ b/docs/manuscripts/cn/应用层/4.HTTP.md
@@ -1,3 +1,7 @@
+---
+title: HTTP
+permalink: /manuscripts/cn/application-layer/http.html
+---
 # HTTP

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/应用层/4.电子邮件.md
+++ b/docs/manuscripts/cn/应用层/4.电子邮件.md
@@ -1,3 +1,7 @@
+---
+title: 电子邮件
+permalink: /manuscripts/cn/application-layer/email.html
+---
 # 电子邮件

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/应用层/5.总结.md
+++ b/docs/manuscripts/cn/应用层/5.总结.md
@@ -1,3 +1,8 @@
+---
+title: 一些总结
+permalink: /manuscripts/cn/application-layer/summary.html
+---
+
 # 总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/1.通信基础.md
+++ b/docs/manuscripts/cn/数据链路层/1.通信基础.md
@@ -1,3 +1,8 @@
+---
+title: 通信基础
+permalink: /manuscripts/cn/data-link-layer/connect-base.html
+---
+
 # 基本功能

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/2.组帧.md
+++ b/docs/manuscripts/cn/数据链路层/2.组帧.md
@@ -1,3 +1,7 @@
+---
+title: 组帧
+permalink: /manuscripts/cn/data-link-layer/framing.html
+---
 # 组帧

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/3.差错控制.md
+++ b/docs/manuscripts/cn/数据链路层/3.差错控制.md
@@ -1,3 +1,7 @@
+---
+title: 差错控制
+permalink: /manuscripts/cn/data-link-layer/error-control.html
+---
 # 差错控制

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/4.流量控制&可靠传输.md
+++ b/docs/manuscripts/cn/数据链路层/4.流量控制&可靠传输.md
@@ -1,3 +1,8 @@
+---
+title: 流量控制&可靠传输
+permalink: /manuscripts/cn/data-link-layer/flow-control.html
+---
+
 # 流量控制&可靠传输

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/5.介质访问控制.md
+++ b/docs/manuscripts/cn/数据链路层/5.介质访问控制.md
@@ -1,3 +1,8 @@
+---
+title: 介质访问控制
+permalink: /manuscripts/cn/data-link-layer/media-access-control.html
+---
+
 # 介质访问控制

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/6.局域网.md
+++ b/docs/manuscripts/cn/数据链路层/6.局域网.md
@@ -1,3 +1,8 @@
+---
+title: 局域网
+permalink: /manuscripts/cn/data-link-layer/local-area-network.html
+---
+
 # 局域网

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/7.广域网.md
+++ b/docs/manuscripts/cn/数据链路层/7.广域网.md
@@ -1,3 +1,8 @@
+---
+title: 广域网
+permalink: /manuscripts/cn/data-link-layer/wan-network.html
+---
+
 # 广域网

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/7.通信设备.md
+++ b/docs/manuscripts/cn/数据链路层/7.通信设备.md
@@ -1,3 +1,7 @@
+---
+title: 通信设备
+permalink: /manuscripts/cn/data-link-layer/equipment.html
+---
 # 通信设备

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/数据链路层/8.总结.md
+++ b/docs/manuscripts/cn/数据链路层/8.总结.md
@@ -1,3 +1,8 @@
+---
+title: 一些总结
+permalink: /manuscripts/cn/data-link-layer/summary.html
+---
+
 # 总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/物理层/1.通信基础.md
+++ b/docs/manuscripts/cn/物理层/1.通信基础.md
@@ -1,3 +1,8 @@
+---
+title: 通信基础
+permalink: /manuscripts/cn/physical-layer/correspondence-base.html
+---
+
 # 通信基础

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/物理层/2.传输介质.md
+++ b/docs/manuscripts/cn/物理层/2.传输介质.md
@@ -1,3 +1,7 @@
+---
+title: 传输介质
+permalink: /manuscripts/cn/physical-layer/transmission-medium.html
+---
 # 传输介质

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/物理层/3.物理层设备.md
+++ b/docs/manuscripts/cn/物理层/3.物理层设备.md
@@ -1,3 +1,8 @@
+---
+title: 物理层设备
+permalink: /manuscripts/cn/physical-layer/devices.html
+---
+
 # 物理层设备

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/物理层/4.总结.md
+++ b/docs/manuscripts/cn/物理层/4.总结.md
@@ -1,3 +1,8 @@
+---
+title: 一些总结
+permalink: /manuscripts/cn/physical-layer/summary.html
+---
+
 # 总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/网络层/1.基本功能.md
+++ b/docs/manuscripts/cn/网络层/1.基本功能.md
@@ -1,3 +1,8 @@
+---
+title: 基本功能
+permalink: /manuscripts/cn/network-layer/base.html
+---
+
 # 基本功能

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/网络层/2.路由算法.md
+++ b/docs/manuscripts/cn/网络层/2.路由算法.md
@@ -1,3 +1,8 @@
+---
+title: 路由算法
+permalink: /manuscripts/cn/network-layer/route-algorithm.html
+---
+
 # 路由算法

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/网络层/3.路由协议.md
+++ b/docs/manuscripts/cn/网络层/3.路由协议.md
@@ -1,3 +1,8 @@
+---
+title: 路由协议
+permalink: /manuscripts/cn/network-layer/route-protocol.html
+---
+
 # 路由协议

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/网络层/4.IPV4.md
+++ b/docs/manuscripts/cn/网络层/4.IPV4.md
@@ -1,3 +1,8 @@
+---
+title: IPV4
+permalink: /manuscripts/cn/network-layer/ipv4.html
+---
+
 # IPV4

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/网络层/5.IPV6.md
+++ b/docs/manuscripts/cn/网络层/5.IPV6.md
@@ -1,3 +1,8 @@
+---
+title: IPV6
+permalink: /manuscripts/cn/network-layer/ipv6.html
+---
+
 # IPV6

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/网络层/6.IP组播&移动IP.md
+++ b/docs/manuscripts/cn/网络层/6.IP组播&移动IP.md
@@ -1,3 +1,8 @@
+---
+title: IP组播&移动IP
+permalink: /manuscripts/cn/network-layer/mobile-ip.html
+---
+
 # IP组播&移动IP

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/网络层/7.网络层设备.md
+++ b/docs/manuscripts/cn/网络层/7.网络层设备.md
@@ -1,3 +1,8 @@
+---
+title: 网络层设备
+permalink: /manuscripts/cn/network-layer/equipment.html
+---
+
 # 网络层设备

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/cn/网络层/8.总结.md
+++ b/docs/manuscripts/cn/网络层/8.总结.md
@@ -1,3 +1,7 @@
+---
+title: 一些总结
+permalink: /manuscripts/cn/network-layer/summary.html
+---
 # 一些总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/串/1.基本概念.md
+++ b/docs/manuscripts/ds/串/1.基本概念.md
@@ -1,3 +1,8 @@
+---
+title: 基本概念
+permalink: /manuscripts/ds/string/base-concept.html
+---
+
 # 基本概念

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/串/2.简单的模式匹配.md
+++ b/docs/manuscripts/ds/串/2.简单的模式匹配.md
@@ -1,3 +1,8 @@
+---
+title: 简单的模式匹配
+permalink: /manuscripts/ds/string/simple-pattern-matching.html
+---
+
 # 简单的模式匹配

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/串/3.KMP算法.md
+++ b/docs/manuscripts/ds/串/3.KMP算法.md
@@ -1,3 +1,7 @@
+---
+title: KMP算法
+permalink: /manuscripts/ds/string/kmp.html
+---
 # KMP算法

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/串/4.总结.md
+++ b/docs/manuscripts/ds/串/4.总结.md
@@ -1,3 +1,8 @@
+---
+title: 一些总结
+permalink: /manuscripts/ds/string/summary.html
+---
+
 # 总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/图论/1.基本概念.md
+++ b/docs/manuscripts/ds/图论/1.基本概念.md
@@ -1,3 +1,8 @@
+---
+title: 基本概念
+permalink: /manuscripts/ds/graph/base-concept.html
+---
+
 # 基本概念

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/图论/2.图的存储.md
+++ b/docs/manuscripts/ds/图论/2.图的存储.md
@@ -1,3 +1,7 @@
+---
+title: 图的存储
+permalink: /manuscripts/ds/graph/store.html
+---
 # 图的存储

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/图论/3.图的遍历.md
+++ b/docs/manuscripts/ds/图论/3.图的遍历.md
@@ -1,3 +1,7 @@
+---
+title: 图的遍历
+permalink: /manuscripts/ds/graph/traverse.html
+---
 # 图的遍历

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/图论/4.图的应用.md
+++ b/docs/manuscripts/ds/图论/4.图的应用.md
@@ -1,3 +1,7 @@
+---
+title: 图的应用
+permalink: /manuscripts/ds/graph/apply.html
+---
 # 图的应用

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/图论/5.总结.md
+++ b/docs/manuscripts/ds/图论/5.总结.md
@@ -1,3 +1,7 @@
+---
+title: 一些总结
+permalink: /manuscripts/ds/graph/summary.html
+---
 # 总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/排序/1.基本概念.md
+++ b/docs/manuscripts/ds/排序/1.基本概念.md
@@ -1,3 +1,8 @@
+---
+title: 基本概念
+permalink: /manuscripts/ds/sort-algorithm/base-concept.html
+---
+
 # 基本概念

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/排序/2.插入排序.md
+++ b/docs/manuscripts/ds/排序/2.插入排序.md
@@ -1,3 +1,8 @@
+---
+title: 插入排序
+permalink: /manuscripts/ds/sort-algorithm/insert-sort.html
+---
+
 # 插入排序

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/排序/3.交换排序.md
+++ b/docs/manuscripts/ds/排序/3.交换排序.md
@@ -1,3 +1,7 @@
+---
+title: 交换排序
+permalink: /manuscripts/ds/sort-algorithm/swap-sort.html
+---
 # 交换排序

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/排序/4.选择排序.md
+++ b/docs/manuscripts/ds/排序/4.选择排序.md
@@ -1,3 +1,7 @@
+---
+title: 选择排序
+permalink: /manuscripts/ds/sort-algorithm/select-sort.html
+---
 # 选择排序

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/排序/5.归并排序.md
+++ b/docs/manuscripts/ds/排序/5.归并排序.md
@@ -1,3 +1,7 @@
+---
+title: 归并排序
+permalink: /manuscripts/ds/sort-algorithm/merge-sort.html
+---
 # 归并排序

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/排序/6.基数排序.md
+++ b/docs/manuscripts/ds/排序/6.基数排序.md
@@ -1,3 +1,8 @@
+---
+title: 基数排序
+permalink: /manuscripts/ds/sort-algorithm/radix-sort.html
+---
+
 # 基数排序

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/排序/7.外部排序.md
+++ b/docs/manuscripts/ds/排序/7.外部排序.md
@@ -1,3 +1,7 @@
+---
+title: 外部排序
+permalink: /manuscripts/ds/sort-algorithm/outer-sort.html
+---
 # 外部排序

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/排序/8.总结.md
+++ b/docs/manuscripts/ds/排序/8.总结.md
@@ -1,3 +1,7 @@
+---
+title: 一些总结
+permalink: /manuscripts/ds/sort-algorithm/summary.html
+---
 # 总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/查找/1.基本概念.md
+++ b/docs/manuscripts/ds/查找/1.基本概念.md
@@ -1,3 +1,8 @@
+---
+title: 基本概念
+permalink: /manuscripts/ds/search-algorithm/base-concept.html
+---
+
 # 基本概念

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/查找/2.顺序查找.md
+++ b/docs/manuscripts/ds/查找/2.顺序查找.md
@@ -1,3 +1,8 @@
+---
+title: 顺序查找
+permalink: /manuscripts/ds/search-algorithm/order-search.html
+---
+
 # 顺序查找

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/查找/3.折半查找.md
+++ b/docs/manuscripts/ds/查找/3.折半查找.md
@@ -1,3 +1,7 @@
+---
+title: 折半查找
+permalink: /manuscripts/ds/search-algorithm/binary-search.html
+---
 # 折半查找

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/查找/4.B树和B+树.md
+++ b/docs/manuscripts/ds/查找/4.B树和B+树.md
@@ -1,3 +1,7 @@
+---
+title: B树和B+树
+permalink: /manuscripts/ds/search-algorithm/balance-tree.html
+---
 # B树和B+树

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/查找/5.散列表.md
+++ b/docs/manuscripts/ds/查找/5.散列表.md
@@ -1,3 +1,7 @@
+---
+title: 散列表
+permalink: /manuscripts/ds/search-algorithm/hash-table.html
+---
 # 散列表

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/查找/6.总结.md
+++ b/docs/manuscripts/ds/查找/6.总结.md
@@ -1,3 +1,8 @@
+---
+title: 一些总结
+permalink: /manuscripts/ds/search-algorithm/summary.html
+---
+
 # 总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/栈和队列/1.栈的基本概念和基本操作.md
+++ b/docs/manuscripts/ds/栈和队列/1.栈的基本概念和基本操作.md
@@ -1,7 +1,7 @@
 ---
 title: 算法和算法评价
 #description: 
-permalink: /manuscripts/ds/stack-basic-concepts.html
+permalink: /manuscripts/ds/stack-queue/stack-basic-concepts.html
 head:   
  - [meta, { name: 数据结构 , content: 栈的基本概念和基本操作 }]
 ---
--- a/docs/manuscripts/ds/栈和队列/2.栈的顺序存储结构.md
+++ b/docs/manuscripts/ds/栈和队列/2.栈的顺序存储结构.md
@@ -1,7 +1,7 @@
 ---
 title: 栈的顺序存储结构
 #description: 
-permalink: /manuscripts/ds/stack-sequential-storage.html
+permalink: /manuscripts/ds/stack-queue/stack-sequential-storage.html
 head:   
  - [meta, { name: 数据结构 , content: 栈的顺序存储结构 }]
 ---
--- a/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md
+++ b/docs/manuscripts/ds/栈和队列/3.栈的链式存储结构.md
@@ -1,7 +1,7 @@
 ---
 title: 栈的链式存储结构
 #description: 
-permalink: /manuscripts/ds/stack-chained-storage.html
+permalink: /manuscripts/ds/stack-queue/stack-chained-storage.html
 head:   
  - [meta, { name: 数据结构 , content: 栈的链式存储结构 }]
 ---
--- a/docs/manuscripts/ds/栈和队列/4.队列的基本概念和操作.md
+++ b/docs/manuscripts/ds/栈和队列/4.队列的基本概念和操作.md
@@ -1,7 +1,7 @@
 ---
 title: 队列的基本概念和操作
 #description: 
-permalink: /manuscripts/ds/queue-basic-concepts.html
+permalink: /manuscripts/ds/stack-queue/queue-basic-concepts.html
 head:   
  - [meta, { name: 数据结构 , content: 队列的基本概念和操作 }]
 ---
--- a/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md
+++ b/docs/manuscripts/ds/栈和队列/5.队列的顺序存储结构.md
@@ -1,7 +1,7 @@
 ---
 title: 队列的顺序存储结构
 #description: 
-permalink: /manuscripts/ds/queue-sequential-storage.html
+permalink: /manuscripts/ds/stack-queue/queue-sequential-storage.html
 head:   
  - [meta, { name: 数据结构 , content: 队列的顺序存储结构 }]
 ---
--- a/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md
+++ b/docs/manuscripts/ds/栈和队列/6.队列的链式存储结构.md
@@ -1,7 +1,7 @@
 ---
 title: 队列的链式存储结构
 #description:
-permalink: /manuscripts/ds/queue-chained-storage.html
+permalink: /manuscripts/ds/stack-queue/queue-chained-storage.html
 head:
 - [meta, { name: 数据结构 , content: 队列的链式存储结构 }]
 ---
--- a/docs/manuscripts/ds/栈和队列/7.栈VS队列补充.md
+++ b/docs/manuscripts/ds/栈和队列/7.栈VS队列补充.md
@@ -1,7 +1,7 @@
 ---
 title: 栈VS队列补充
 #description: 
-permalink: /manuscripts/ds/stack-vs-queue.html
+permalink: /manuscripts/ds/stack-queue/stack-vs-queue.html
 head:   
  - [meta, { name: 数据结构 , content: 栈VS队列补充 }]
 ---
--- a/docs/manuscripts/ds/树和二叉树/1.基本概念.md
+++ b/docs/manuscripts/ds/树和二叉树/1.基本概念.md
@@ -1,3 +1,8 @@
+---
+title: 基本概念
+permalink: /manuscripts/ds/tree/base-concept.html
+---
+
 # 基本概念

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/树和二叉树/2.二叉树.md
+++ b/docs/manuscripts/ds/树和二叉树/2.二叉树.md
@@ -1,3 +1,8 @@
+---
+title: 二叉树
+permalink: /manuscripts/ds/tree/binary-tree.html
+---
+
 # 二叉树

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/树和二叉树/3.二叉树的遍历.md
+++ b/docs/manuscripts/ds/树和二叉树/3.二叉树的遍历.md
@@ -1,3 +1,8 @@
+---
+title: 二叉树的遍历
+permalink: /manuscripts/ds/tree/binary-tree-traverse.html
+---
+
 # 二叉树的遍历

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/树和二叉树/4.线索二叉树.md
+++ b/docs/manuscripts/ds/树和二叉树/4.线索二叉树.md
@@ -1,3 +1,7 @@
+---
+title: 线索二叉树
+permalink: /manuscripts/ds/tree/threaded-binary-tree.html
+---
 # 线索二叉树

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/树和二叉树/5.树和森林.md
+++ b/docs/manuscripts/ds/树和二叉树/5.树和森林.md
@@ -1,3 +1,8 @@
+---
+title: 树和森林
+permalink: /manuscripts/ds/tree/tree-forest.html
+---
+
 # 树和森林

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/树和二叉树/6.树的应用.md
+++ b/docs/manuscripts/ds/树和二叉树/6.树的应用.md
@@ -1,3 +1,4 @@
+
 # 树的应用

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/树和二叉树/7.总结.md
+++ b/docs/manuscripts/ds/树和二叉树/7.总结.md
@@ -1,3 +1,8 @@
+---
+title: 一些总结
+permalink: /manuscripts/ds/tree/summary.html
+---
+
 # 一些总结

 努力赶稿中，等等我呀...
--- a/docs/manuscripts/ds/线性表/1.基础概念和操作.md
+++ b/docs/manuscripts/ds/线性表/1.基础概念和操作.md
@@ -1,7 +1,7 @@
 ---
 title: 基础概念
 #description: 
-permalink: /manuscripts/ds/linear-table-basic-concepts.html
+permalink: /manuscripts/ds/linear-table/basic-concepts.html
 head:   
  - [meta, { name: 数据结构 , content: 线性表的基础概念和操作 }]
 ---
--- a/docs/manuscripts/ds/线性表/2.顺序表示.md
+++ b/docs/manuscripts/ds/线性表/2.顺序表示.md
@@ -0,0 +1,249 @@
+---
+title: 顺序表示
+#description: 
+permalink: /manuscripts/ds/linear-table/sequential-representation.html
+head:   
+  - [meta, { name: 顺序表示 , content: 顺序表示 }]
+---
+
+
+# 顺序表示
+
+## 定义
+
+`顺序表`：顺序存储的线性表，**是用一组地址连续的存储单元，依次存储线性表中的数据元素，使得在逻辑上相邻的两个元素在物理位置上也相邻。**
+
+![](./images/线性表的存储结构.png)
+
+顺序表中的元素的逻辑顺序与实际的物理位置相同
+
+注意：
+
+- 线性表中的元素的位序是从1开始的，例如1、2、3...
+- 数组中的元素的下标是从0开始的，例如0、1、2...
+
+```c
+# define MaxSize 20         // 定义常量MaxSize 用来声明顺序表的最大长度
+
+// 线性表结构体定义【ElemType用来代指顺序表中元素的类型，例如高级语言中的int、string....】
+typedef struct{
+    ElemType data[MaxSize];     // 顺序表的元素
+    int length;                 // 顺序表的长度
+}SqList
+
+```
+
+### 存储分配
+
+`静态分配`：数组的大小和空间都是实现确定好的，一旦存储空间占满就会产生溢出，直接导致程序崩溃。（有点内存不够，宕机重启的意思....）
+
+`动态分配`：存储数据的空间在程序执行过程中通过`动态存储分配语句`分配的，即便是数据空间占满，也可以另外开辟一块更大的空间，来替换原来的存储空间，满足扩充数据空间的目的。（有点动态规划的意思....）最重要的是：**不需要像静态分配那样，一次性地固定线性表的空间和大小**
+
+```c
+#define InitSize 100    // 表长度初始化
+
+
+// 动态分配数组顺序表的结构体定义
+typedef struct{
+    ElemType *data;             // 动态分配数组的指针
+    int MaxSize,length;         // 数组的最大容量和当前元素个数
+}SqList;    
+
+```
+
+动态分配语句
+
+```C
+// C语言中
+
+L.data=(ElemType*)malloc(sizeof(ElemType)*InitSize);
+
+
+// C++ 中
+
+L.data=new ElemType[InitSize];
+
+```
+
+`malloc()函数`： 指针型函数，返回的指针指向该分配域的开头的位置。作用是在内存的动态存储区中分配一个长度为size的连续空间。[百度百科](https://baike.baidu.com/item/malloc%E5%87%BD%E6%95%B0/8582146?fr=aladdin)
+
+**动态分配不是链式存储，而是属于顺序存储结构**，动态分配的物理结构没有改变，依然是随机存取的方式。只是分配的空间大小可以在运行时决定；
+
+### 顺序表的特点
+
+- 随机访问【这是最主要的特点】，通过存储起始地址和元素序号O(1)时间内访问指定元素。
+- 存储密度高，没有结点只存储数据元素，不像索引存储那样，还需要索引表什么的..
+- 逻辑上相邻的元素物理上也相邻，插入和删除需要移动大量元素
+
+## 基本操作
+
+### 插入
+
+在顺序表L的第i（1≤i≤L.length+1）个位置插入新的元素e
+
+- 第一步：如果i非法，则直接返回false，插入失败，结束插入过程
+- 第二步：i正常，将表的第i个元素以及后面的所有元素都向右移动一个位置，在腾出来的空位置插入元素e
+- 第三步：顺序表插入成功，返回true
+
+注意：先判空和临界值，提高算法健壮性
+
+```cpp
+
+/*
+ * @Description: 顺序表的插入操作
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2020-02-23 07:48:26
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2020-02-23 07:48:26
+ */
+bool ListInsert(SqList &L, int i, ElemType e){
+
+  // i非法 i=1 表头 i=L.length+1 表尾巴
+  if(i<1||i>L.length+1){
+    return false;
+  }
+
+  // 存储空间满，无法插入
+  if(L.length >= MaxSize){
+    return false;
+  }
+
+  // 遍历，将位置元素往后移动，注意从后往前循环，避免值被覆盖
+  for(int j=L.length; j>=i;j--){
+    L.data[j]=L.data[j-1];
+  }
+
+  // 此时，表L中的第i个元素和第i+1元素素值一样，将新元素存入i位置即可
+
+  // 第i个元素，对应的位置角标为i-1
+  L.data[i-1]=e;
+
+  // 表长度加1
+  L.length++;
+
+  // 返回插入成功
+  return true;
+}
+
+```
+
+注意：区别顺序表中的位序和角标；
+
+**时间复杂度**
+
+![](./images/顺序表插入平均时间复杂度计算.png)
+
+- 最好情况：在表尾插入，元素向后移动循环没有执行，时间复杂度O(1);
+- 最坏情况：在表头插入，元素后移循环执行n次，时间复杂度为O(n);
+- 平均情况：随机插入，平均次数为：n/2，对应的平均复杂度为O(n);
+
+**线性表插入算法的平均时间复杂度为：O(n)**
+
+> Tips: 需要根据实现代码理解循环为什么是从后往前来实现元素后移，通过for循环可以很明显的看出表尾插入快，表头插入慢
+
+#### 删除
+
+删除顺序表L中第i（1≤i≤L.length+1）个位置的元素
+
+- 成功，返回true,将被删除的元素用引用变量返回；
+- 失败，返回false
+
+```cpp
+
+/*
+ * @Description: 顺序表的删除操作
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2020-02-23 07:48:26
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2020-02-23 07:48:26
+ */
+bool ListDelete(SqList &L, int i, ElemType &e){
+
+  // i非法 i=1 表头 i=L.length+1 表尾巴
+  if(i<1||i>L.length+1){
+    return false;
+  }
+
+  // 存储空间满，无法插入
+  if(L.length >= MaxSize){
+    return false;
+  }
+  
+  // 引用变量e赋值
+  e=L.data[i-1]
+
+  // 遍历，第i个元素后面的往前移动
+  for(int j=i; j<=L.length;j++){
+    // 从第i个元素开始，角标从i-1开始
+    L.data[j-1]=L.data[j];
+  }
+
+  // 此时，表L中的表尾元素和倒数第二个元素值一样，将表的长度-1 
+
+  // 表长度减1
+  L.length--;
+
+  // 返回删除成功
+  return true;
+}
+
+```
+
+从这里来看，删除、插入元素都会涉及到大量的元素的移动（最好情况例外），总结而言：
+
+- 元素从后往前移，循环从前往后遍历
+- 元素从前往后移，循环从后往前遍历
+
+**时间复杂度：**
+
+![](./images/顺序表随机删除元素的平均复杂度计算.png)
+
+- 最好情况：删除表尾元素，不需要移动任何元素，时间复杂度为O(1)；
+- 最坏情况：删除表头元素，需要移动除第一个元素外的所有元素，时间复杂度为O(n)；
+- 平均情况：随机删除，平均需要(n-1)/2，对应的时间复杂度为O(n)；
+
+**线性表删除算法的平均时间复杂度为O(n)；**
+
+### 按值查找（顺序查找）
+
+在顺序表L中查找第一个元素值等于e的元素，并返回位序
+
+```cpp
+/*
+ * @Description: 顺序表的按值查找（顺序查找）
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2020-02-23 07:48:26
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2020-02-23 07:48:26
+ */
+int LocateElem(SqList L,ElemType e){
+    int i;
+    // 循环判断
+    for(i=0;i<L.length;i++){
+        if(L.data[i]===e){
+            // i是元素的角标，i+1是具体元素的位序号
+            return i+1;
+        }
+    }
+    
+    // 未命中，返回0,即：没有
+    return 0;
+    
+}
+
+```
+
+注意理解`位序`的含义，即元素在线性表中的位置序号，角标为`i`（角标从0开始）,对应的位序为`i+1`（位序从1开始）。当返回为0时，则直接代表没有`命中`；
+
+**时间复杂度：**
+
+- 最好情况：查找的元素在表头，只需要比较一次，循环成本最小，时间复杂度为O(1);
+- 最坏情况：查找的元素在表尾或者不存在，需要完整遍历，比较n次，时间复杂度为O(n);
+- 平均情况：随机查找表上的第i个（1≤i≤L.length）元素,平均次数为(n+1)/2,对应时间复杂度为O(n)
+
+**线性表按值查找（顺序查找）的平均时间复杂度为O(n)；**
+
+**顺序存取是读写方式，不是存储结构；顺序存储是存储结构，包括有：顺序存储、链式存储、索引存储、散列存储**
--- a/docs/manuscripts/ds/线性表/3.链式表示.md
+++ b/docs/manuscripts/ds/线性表/3.链式表示.md
@@ -1,7 +1,7 @@
 ---
 title: 链式表示
 #description: 
-permalink: /manuscripts/ds/linear-table-chained-representation.html
+permalink: /manuscripts/ds/linear-table/chained-representation.html
 head:   
  - [meta, { name: 数据结构 , content: 线性表的链式表示 }]
 ---
@@ -545,18 +545,7 @@ typedef struct DNode{

 ## 静态链表

-```mindmap
-root(链式表示)
-    单链表
-    头结点
-    头插法
-    尾插法
-    按序号查找
-    按值查找
-    结点插入
-    删除结点
-    计算表长
-```
+![](./images/静态链表存储结构.png)

 > 借助数组来描述线性表的链式存储结构，结点元素同样存在数据域`data`和指针域`next`

--- a/docs/manuscripts/ds/线性表/4.总结.md
+++ b/docs/manuscripts/ds/线性表/4.总结.md
@@ -1,7 +1,7 @@
 ---
 title: 链式表示
 #description: 
-permalink: /manuscripts/ds/linear-table-summary.html
+permalink: /manuscripts/ds/linear-table/summary.html
 head:   
  - [meta, { name: 数据结构 , content: 线性表总结 }]
 ---
--- a/docs/manuscripts/ds/线性表/images/带头结点的单链表.png
+++ b/docs/manuscripts/ds/线性表/images/带头结点的单链表.png
--- a/docs/manuscripts/ds/线性表/images/线性表按值查找平均时间复杂度计算.png
+++ b/docs/manuscripts/ds/线性表/images/线性表按值查找平均时间复杂度计算.png
--- a/docs/manuscripts/ds/线性表/images/线性表的存储结构.png
+++ b/docs/manuscripts/ds/线性表/images/线性表的存储结构.png
--- a/docs/manuscripts/ds/线性表/images/静态链表存储结构.png
+++ b/docs/manuscripts/ds/线性表/images/静态链表存储结构.png
--- a/docs/manuscripts/ds/线性表/images/顺序表插入平均时间复杂度计算.png
+++ b/docs/manuscripts/ds/线性表/images/顺序表插入平均时间复杂度计算.png
--- a/docs/manuscripts/ds/线性表/images/顺序表随机删除元素的平均复杂度计算.png
+++ b/docs/manuscripts/ds/线性表/images/顺序表随机删除元素的平均复杂度计算.png
--- a/docs/manuscripts/job-poster-bytedance.md
+++ b/docs/manuscripts/job-poster-bytedance.md
@@ -1,3 +1,8 @@
+---
+title: 工作机会
+permalink: /manuscripts/job-poster-bytedance.html
+---
+
 # 工作机会

 ### 字节工作内推
--- a/docs/manuscripts/mark-map/ccp-map.html
+++ b/docs/manuscripts/mark-map/ccp-map.html
@@ -0,0 +1,40 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta charset="UTF-8">
+<meta name="viewport" content="width=device-width, initial-scale=1.0">
+<meta http-equiv="X-UA-Compatible" content="ie=edge">
+<title>Markmap</title>
+<style>
+* {
+  margin: 0;
+  padding: 0;
+}
+#mindmap {
+  display: block;
+  width: 100vw;
+  height: 100vh;
+}
+</style>
+<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/markmap-toolbar@0.15.4/dist/style.css">
+</head>
+<body>
+<svg id="mindmap"></svg>
+<script src="https://cdn.jsdelivr.net/npm/d3@7.8.5/dist/d3.min.js"></script><script src="https://cdn.jsdelivr.net/npm/markmap-view@0.15.4/dist/browser/index.js"></script><script src="https://cdn.jsdelivr.net/npm/markmap-toolbar@0.15.4/dist/index.js"></script><script>(r => {
+          setTimeout(r);
+        })(() => {
+  const {
+    markmap,
+    mm
+  } = window;
+  const toolbar = new markmap.Toolbar();
+  toolbar.attach(mm);
+  const el = toolbar.render();
+  el.setAttribute('style', 'position:absolute;bottom:20px;right:20px');
+  document.body.append(el);
+})</script><script>((getMarkmap, getOptions, root, jsonOptions) => {
+          const markmap = getMarkmap();
+          window.mm = markmap.Markmap.create('svg#mindmap', (getOptions || markmap.deriveOptions)(jsonOptions), root);
+        })(() => window.markmap,null,{"type":"heading","depth":0,"payload":{"lines":[0,1]},"content":"计算机组成原理","children":[{"type":"heading","depth":1,"payload":{"lines":[4,5]},"content":"引论","children":[]},{"type":"heading","depth":1,"payload":{"lines":[6,7]},"content":"数据的表示和运算","children":[]},{"type":"heading","depth":1,"payload":{"lines":[8,9]},"content":"存储系统","children":[]},{"type":"heading","depth":1,"payload":{"lines":[10,11]},"content":"中央处理器","children":[]},{"type":"heading","depth":1,"payload":{"lines":[12,13]},"content":"总线","children":[]},{"type":"heading","depth":1,"payload":{"lines":[14,15]},"content":"输入输出系统","children":[]},{"type":"heading","depth":1,"payload":{"lines":[16,17]},"content":"一些总结","children":[]}]},null)</script>
+</body>
+</html>
--- a/docs/manuscripts/mark-map/ccp-map.md
+++ b/docs/manuscripts/mark-map/ccp-map.md
@@ -1,3 +1,8 @@
+---
+title: 计算机组成原理
+permalink: /manuscripts/mark-map/ccp-map.html
+headerDepth: 3
+---
 # 计算机组成原理

 <a href="../../mark-map/ccp-map.html" target="_blank">在线预览</a>
--- a/docs/manuscripts/mark-map/cn-map.html
+++ b/docs/manuscripts/mark-map/cn-map.html
@@ -0,0 +1,40 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta charset="UTF-8">
+<meta name="viewport" content="width=device-width, initial-scale=1.0">
+<meta http-equiv="X-UA-Compatible" content="ie=edge">
+<title>Markmap</title>
+<style>
+* {
+  margin: 0;
+  padding: 0;
+}
+#mindmap {
+  display: block;
+  width: 100vw;
+  height: 100vh;
+}
+</style>
+<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/markmap-toolbar@0.15.4/dist/style.css">
+</head>
+<body>
+<svg id="mindmap"></svg>
+<script src="https://cdn.jsdelivr.net/npm/d3@7.8.5/dist/d3.min.js"></script><script src="https://cdn.jsdelivr.net/npm/markmap-view@0.15.4/dist/browser/index.js"></script><script src="https://cdn.jsdelivr.net/npm/markmap-toolbar@0.15.4/dist/index.js"></script><script>(r => {
+          setTimeout(r);
+        })(() => {
+  const {
+    markmap,
+    mm
+  } = window;
+  const toolbar = new markmap.Toolbar();
+  toolbar.attach(mm);
+  const el = toolbar.render();
+  el.setAttribute('style', 'position:absolute;bottom:20px;right:20px');
+  document.body.append(el);
+})</script><script>((getMarkmap, getOptions, root, jsonOptions) => {
+          const markmap = getMarkmap();
+          window.mm = markmap.Markmap.create('svg#mindmap', (getOptions || markmap.deriveOptions)(jsonOptions), root);
+        })(() => window.markmap,null,{"type":"heading","depth":0,"payload":{"lines":[0,1]},"content":"计算机网络","children":[{"type":"heading","depth":1,"payload":{"lines":[4,5]},"content":"体系结构","children":[]},{"type":"heading","depth":1,"payload":{"lines":[6,7]},"content":"物理层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[8,9]},"content":"数据链路层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[10,11]},"content":"网络层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[12,13]},"content":"传输层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[14,15]},"content":"应用层","children":[]},{"type":"heading","depth":1,"payload":{"lines":[16,17]},"content":"一些总结","children":[]}]},null)</script>
+</body>
+</html>
--- a/docs/manuscripts/mark-map/cn-map.md
+++ b/docs/manuscripts/mark-map/cn-map.md
@@ -1,3 +1,9 @@
+---
+title: 计算机网络
+permalink: /manuscripts/mark-map/cn-map.html
+headerDepth: 3
+---
+
 # 计算机网络

 <a href="../../mark-map/cn-map.html" target="_blank">在线预览</a>
--- a/docs/manuscripts/mark-map/ds-map.html
+++ b/docs/manuscripts/mark-map/ds-map.html
--- a/docs/manuscripts/mark-map/ds-map.md
+++ b/docs/manuscripts/mark-map/ds-map.md
@@ -1,3 +1,9 @@
+---
+title: 数据结构
+permalink: /manuscripts/mark-map/ds-map.html
+headerDepth: 3
+---
+
 # 数据结构

 <a href="../../mark-map/ds-map.html" target="_blank">在线预览</a>
--- a/docs/manuscripts/mark-map/os-map.html
+++ b/docs/manuscripts/mark-map/os-map.html
@@ -0,0 +1,40 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta charset="UTF-8">
+<meta name="viewport" content="width=device-width, initial-scale=1.0">
+<meta http-equiv="X-UA-Compatible" content="ie=edge">
+<title>Markmap</title>
+<style>
+* {
+  margin: 0;
+  padding: 0;
+}
+#mindmap {
+  display: block;
+  width: 100vw;
+  height: 100vh;
+}
+</style>
+<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/markmap-toolbar@0.15.4/dist/style.css">
+</head>
+<body>
+<svg id="mindmap"></svg>
+<script src="https://cdn.jsdelivr.net/npm/d3@7.8.5/dist/d3.min.js"></script><script src="https://cdn.jsdelivr.net/npm/markmap-view@0.15.4/dist/browser/index.js"></script><script src="https://cdn.jsdelivr.net/npm/markmap-toolbar@0.15.4/dist/index.js"></script><script>(r => {
+          setTimeout(r);
+        })(() => {
+  const {
+    markmap,
+    mm
+  } = window;
+  const toolbar = new markmap.Toolbar();
+  toolbar.attach(mm);
+  const el = toolbar.render();
+  el.setAttribute('style', 'position:absolute;bottom:20px;right:20px');
+  document.body.append(el);
+})</script><script>((getMarkmap, getOptions, root, jsonOptions) => {
+          const markmap = getMarkmap();
+          window.mm = markmap.Markmap.create('svg#mindmap', (getOptions || markmap.deriveOptions)(jsonOptions), root);
+        })(() => window.markmap,null,{"type":"heading","depth":0,"payload":{"lines":[0,1]},"content":"操作系统","children":[{"type":"heading","depth":1,"payload":{"lines":[4,5]},"content":"引论","children":[]},{"type":"heading","depth":1,"payload":{"lines":[6,7]},"content":"进程管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[8,9]},"content":"内存管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[10,11]},"content":"一些总结","children":[]},{"type":"heading","depth":1,"payload":{"lines":[12,13]},"content":"I/O管理","children":[]},{"type":"heading","depth":1,"payload":{"lines":[14,15]},"content":"文件管理","children":[]}]},null)</script>
+</body>
+</html>
--- a/Show More
+++ b/Show More