publish blog: linked-list-代码模板与例题

Author: makerfly-dev[bot]

public/blogs/index.json

@@ -1,4 +1,12 @@
 [
+  {
+    "slug": "network-layer-routing-学习笔记",
+    "title": "Network Layer Routing 学习笔记",
+    "date": "2026-07-05",
+    "summary": "> 主题：CST309 Computer Networks and Communication — Network Layer Part 2: Routing  \n> 目标：理解 Router 如何转发 packet、Routing Table 如何产生与更新，以及 Dynamic Routing 中 Distance Vector 与 Link-State 两类协议的关系。",
+    "tags": [],
+    "category": "ComputerNetworks"
+  },
   {
     "slug": "linked-list-代码模板与例题",
     "title": "Linked List 代码模板与例题",
@@ -9,14 +17,6 @@
     ],
     "category": "algorithm"
   },
-  {
-    "slug": "network-layer-routing-学习笔记",
-    "title": "Network Layer Routing 学习笔记",
-    "date": "2026-07-05",
-    "summary": "> 主题：CST309 Computer Networks and Communication — Network Layer Part 2: Routing  \n> 目标：理解 Router 如何转发 packet、Routing Table 如何产生与更新，以及 Dynamic Routing 中 Distance Vector 与 Link-State 两类协议的关系。",
-    "tags": [],
-    "category": "ComputerNetworks"
-  },
   {
     "slug": "为什么vibe-coding-的你一定要掌握-harness-engineering-驾驭工程",
     "title": "为什么vibe coding 的你一定要掌握 Harness Engineering（驾驭工程）",

public/blogs/linked-list-代码模板与例题/index.md

@@ -334,15 +334,12 @@ int main() {
 }
 ```
 ________________________________________
-2. 例题指引
-顺序	题目	难度	对应知识点
-1	203. Remove Linked List Elements
-Easy	删除指定值节点，对应 DeleteNode
-2	83. Remove Duplicates from Sorted List
-Easy	遍历链表，删除重复节点
-3	876. Middle of the Linked List
-Easy	链表遍历，理解 currNode = currNode->next
-4	206. Reverse Linked List
-Easy	修改 next 指针
-5	21. Merge Two Sorted Lists
-Easy	连接两个链表
+## 2. LeetCode 例题指引
+
+| 顺序 | 题目 | 难度 | 对应知识点 |
+| --- | --- | --- | --- |
+| 1 | 203. Remove Linked List Elements | Easy | 删除指定值节点，对应 DeleteNode |
+| 2 | 83. Remove Duplicates from Sorted List | Easy | 遍历链表，删除重复节点 |
+| 3 | 876. Middle of the Linked List | Easy | 链表遍历，理解 currNode = currNode->next |
+| 4 | 206. Reverse Linked List | Easy | 修改 next 指针 |
+| 5 | 21. Merge Two Sorted Lists | Easy | 连接两个链表 |