add 127 208 211 212

Author: 2xiao

assets/output/0127.md

@@ -167,6 +167,7 @@ export default sidebar({
             "0123",
             "0124",
             "0125",
+            "0127",
             "0128",
             "0129",
             "0130",
@@ -215,8 +216,11 @@ export default sidebar({
             "0205",
             "0206",
             "0207",
+            "0208",
             "0209",
             "0210",
+            "0211",
+            "0212",
             "0215",
             "0216",
             "0217",

assets/output/0208.md

@@ -102,13 +102,13 @@ BF 算法的思想可以用一句话来概括：在主串中检查起始位置
 
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
-| 0208 | [实现 Trie (前缀树)](https://leetcode.com/problems/implement-trie-prefix-tree/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> |
+| 0208 | [实现 Trie (前缀树)](https://leetcode.com/problems/implement-trie-prefix-tree/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0208) |  [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> |
 | 0677 | [键值映射](https://leetcode.com/problems/map-sum-pairs/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> |
 | 0648 | [单词替换](https://leetcode.com/problems/replace-words/) |  |  [`字典树`](/leetcode/outline/tag/trie.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> |
 | 0642 | [设计搜索自动补全系统](https://leetcode.com/problems/design-search-autocomplete-system/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ff334b>Hard</font> |
-| 0211 | [添加与搜索单词 - 数据结构设计](https://leetcode.com/problems/design-add-and-search-words-data-structure/) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) `1+` | <font color=#ffb800>Medium</font> |
+| 0211 | [添加与搜索单词 - 数据结构设计](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0211) |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) `1+` | <font color=#ffb800>Medium</font> |
 | 0421 | [数组中两个数的最大异或值](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`字典树`](/leetcode/outline/tag/trie.md) [`数组`](/leetcode/outline/tag/array.md) `1+` | <font color=#ffb800>Medium</font> |
-| 0212 | [单词搜索 II](https://leetcode.com/problems/word-search-ii/) |  |  [`字典树`](/leetcode/outline/tag/trie.md) [`数组`](/leetcode/outline/tag/array.md) [`字符串`](/leetcode/outline/tag/string.md) `2+` | <font color=#ff334b>Hard</font> |
+| 0212 | [单词搜索 II](https://leetcode.com/problems/word-search-ii/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0212) |  [`字典树`](/leetcode/outline/tag/trie.md) [`数组`](/leetcode/outline/tag/array.md) [`字符串`](/leetcode/outline/tag/string.md) `2+` | <font color=#ff334b>Hard</font> |
 | 0425 | [单词方块](https://leetcode.com/problems/word-squares/) |  |  [`字典树`](/leetcode/outline/tag/trie.md) [`数组`](/leetcode/outline/tag/array.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ff334b>Hard</font> |
 | 0336 | [回文对](https://leetcode.com/problems/palindrome-pairs/) |  |  [`字典树`](/leetcode/outline/tag/trie.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ff334b>Hard</font> |
 | 1023 | [驼峰式匹配](https://leetcode.com/problems/camelcase-matching/) |  |  [`字典树`](/leetcode/outline/tag/trie.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ffb800>Medium</font> |

assets/output/0211.md

@@ -1,31 +1,31 @@
 # 1.4 学习计划
 
 <html>
-<div class="plan-box">
+<div class="plan-box box1">
   <a href="./top_150_list.html">
     <img class="plan" src="../../../../assets/image/plan-2.png" alt="top150"/>
   </a>
   <a href="./top_200_list.html">
     <img class="plan" src="../../../../assets/image/plan-1.png" alt="top200"/>
   </a>
 </div>
-<div class="plan-box">
+<div class="plan-box box2">
   <a href="./top_300_list.html">
     <img class="plan" src="../../../../assets/image/plan-5.png" alt="top_300"/>
   </a>
   <a href="./company_list.html">
     <img class="plan" src="../../../../assets/image/plan-6.png" alt="company"/>
   </a>
 </div>
-<div class="plan-box">
+<div class="plan-box box3">
   <a href="./offer_list.html">
     <img class="plan" src="../../../../assets/image/plan-7.png" alt="offer"/>
   </a>
   <a href="./offer2_list.html">
     <img class="plan" src="../../../../assets/image/plan-8.png" alt="offer2"/>
   </a>
 </div>
-<div class="plan-box">
+<div class="plan-box box4">
   <a href="./codetop_list.html">
     <img class="plan" src="../../../../assets/image/plan-3.png" alt="codetop"/>
   </a>
@@ -42,12 +42,13 @@
     justify-content: space-evenly;
 }
 .plan {
-    margin: 10px 0;
+    margin: 10px 15px;
     border-radius: 5px;
     height: 9rem;
 }
 .plan:hover {
   box-shadow: 0 2px 12px #f0f1f2;
+  zoom: 1.03;
 }
 </style>
 </html>

assets/output/0212.md

@@ -159,7 +159,7 @@ headerDepth: 0
 | 0328 | [奇偶链表](https://leetcode.com/problems/odd-even-linked-list/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0328) |  [`链表`](/leetcode/outline/tag/linked-list.md) | <font color=#ffb800>Medium</font> | 28 |
 | 0091 | [解码方法](https://leetcode.com/problems/decode-ways/) |  |  [`字符串`](/leetcode/outline/tag/string.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> | 28 |
 | 0329 | [矩阵中的最长递增路径](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`图`](/leetcode/outline/tag/graph.md) `5+` | <font color=#ff334b>Hard</font> | 28 |
-| 0208 | [实现 Trie (前缀树)](https://leetcode.com/problems/implement-trie-prefix-tree/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> | 27 |
+| 0208 | [实现 Trie (前缀树)](https://leetcode.com/problems/implement-trie-prefix-tree/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0208) |  [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> | 27 |
 | 0009 | [回文数](https://leetcode.com/problems/palindrome-number/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0009) |  [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#15bd66>Easy</font> | 27 |
 | 0010 | [正则表达式匹配](https://leetcode.com/problems/regular-expression-matching/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0010) |  [`递归`](/leetcode/outline/tag/recursion.md) [`字符串`](/leetcode/outline/tag/string.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ff334b>Hard</font> | 26 |
 | 0295 | [数据流的中位数](https://leetcode.com/problems/find-median-from-data-stream/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`数据流`](/leetcode/outline/tag/data-streams.md) `2+` | <font color=#ff334b>Hard</font> | 26 |