feat: add solutions to lc problem: No.0707

No.0707.Design Linked List

Author: yanglbme

README.md

@@ -49,9 +49,15 @@
 -   [乘积小于 K 的子数组](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md) - 双指针
 -   [位 1 的个数](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md) - 位运算、lowbit
 -   [合并区间](/solution/0000-0099/0056.Merge%20Intervals/README.md) - 区间合并
-
 <!-- 排序算法、待补充 -->
 
+<!-- 
+### 2. 数据结构
+
+-   [设计链表](/solution/0700-0799/0707.Design%20Linked%20List/README.md) - 单链表、指针引用、数组实现
+ -->
+
+
 ### 2. 搜索
 
 -   [图像渲染](/solution/0700-0799/0733.Flood%20Fill/README.md)- BFS、DFS、Flood Fill 算法、连通性模型

README_EN.md

@@ -49,6 +49,12 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
 -   [Number of 1 Bits](/solution/0100-0199/0191.Number%20of%201%20Bits/README_EN.md) - Bit manipulation, Lowbit
 -   [Merge Intervals](/solution/0000-0099/0056.Merge%20Intervals/README_EN.md) - Merge intervals
 
+<!-- 
+### 2. Data Structures
+
+-   [Design Linked List](/solution/0700-0799/0707.Design%20Linked%20List/README_EN.md) - Linked List, Pointer, Array
+ -->
+
 ### 2. Search
 
 -   [Flood Fill](/solution/0700-0799/0733.Flood%20Fill/README_EN.md) - BFS, DFS, Flood fill