update solution.md

data/1.算法初阶/2.蓝桥杯-字符串/6.不同子串/solution.md

@@ -45,16 +45,19 @@ s.insert(str.substr(i, j - i + 1));
 ## 选项
 
 ### A
+
 ```cpp
 s.insert(str.substr(i, j + i + 1));
 ```
 
 ### B
+
 ```cpp
 s.insert(str.substr(i, j - i - 1));
 ```
 
 ### C
+
 ```cpp
 s.insert(str.substr(i, j - i));
 ```

data/3.算法高阶/1.leetcode-树/10.103-二叉树的锯齿形层序遍历/solution.md

@@ -108,6 +108,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -153,6 +154,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -202,6 +204,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/1.leetcode-树/8.101-对称二叉树/solution.md

@@ -95,6 +95,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -127,6 +128,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -149,6 +151,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/1.leetcode-树/9.102-二叉树的层序遍历/solution.md

@@ -90,6 +90,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -127,6 +128,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 
 class Solution
@@ -157,6 +159,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/2.leetcode-哈希表/10.166-分数到小数/solution.md

@@ -156,6 +156,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -191,6 +192,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -232,6 +234,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/2.leetcode-哈希表/7.126-单词接龙 II/solution.md

@@ -149,6 +149,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -221,6 +222,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -291,6 +293,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/2.leetcode-哈希表/8.127-单词接龙/solution.md

@@ -127,6 +127,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -165,6 +166,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -211,6 +213,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/2.leetcode-哈希表/9.128-最长连续序列/solution.md

@@ -90,6 +90,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 
 class Solution
@@ -118,6 +119,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -200,6 +202,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/3.leetcode-图与搜索/10.130-被围绕的区域/solution.md

@@ -122,6 +122,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -175,6 +176,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -236,6 +238,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/3.leetcode-图与搜索/8.112-路径总和/solution.md

@@ -72,6 +72,7 @@ struct TreeNode
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -116,6 +117,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 
 class Solution
@@ -147,6 +149,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/3.leetcode-图与搜索/9.113-路径总和 II/solution.md

@@ -102,6 +102,7 @@ private:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -143,6 +144,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -171,6 +173,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/5.leetcode-设计/10.297-二叉树的序列化与反序列化/solution.md

@@ -113,6 +113,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Codec
 {
@@ -151,6 +152,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Codec
 {
@@ -265,6 +267,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Codec
 {

data/3.算法高阶/5.leetcode-设计/6.173-二叉搜索树迭代器/solution.md

@@ -135,6 +135,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class BSTIterator
 {
@@ -177,6 +178,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class BSTIterator
 {
@@ -219,6 +221,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class BSTIterator
 {

data/3.算法高阶/5.leetcode-设计/7.208-实现 Trie (前缀树)/solution.md

@@ -128,6 +128,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 struct TrieNode
 {
@@ -185,6 +186,7 @@ private:
 ```
 
 ### B
+
 ```cpp
 struct TrieNode
 {
@@ -245,6 +247,7 @@ private:
 ```
 
 ### C
+
 ```cpp
 struct Node
 {

data/3.算法高阶/5.leetcode-设计/8.535-TinyURL 的加密与解密/solution.md

@@ -48,6 +48,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -83,6 +84,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -129,6 +131,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/5.leetcode-设计/9.341-扁平化嵌套列表迭代器/solution.md

@@ -120,6 +120,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class NestedIterator
 {
@@ -159,6 +160,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class NestedIterator
 {
@@ -195,6 +197,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class NestedIterator
 {

data/3.算法高阶/8.leetcode-贪心/10.330-按要求补齐数组/solution.md

@@ -90,6 +90,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -118,6 +119,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -142,6 +144,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/8.leetcode-贪心/7.179-最大数/solution.md

@@ -98,6 +98,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -117,6 +118,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -136,6 +138,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

data/3.算法高阶/8.leetcode-贪心/8.316-去除重复字母/solution.md

@@ -97,6 +97,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -149,6 +150,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -177,6 +179,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 
 class Solution

data/3.算法高阶/8.leetcode-贪心/9.321-拼接最大数/solution.md

@@ -119,6 +119,7 @@ public:
 ## 选项
 
 ### A
+
 ```cpp
 class Solution
 {
@@ -241,6 +242,7 @@ public:
 ```
 
 ### B
+
 ```cpp
 class Solution
 {
@@ -296,6 +298,7 @@ public:
 ```
 
 ### C
+
 ```cpp
 class Solution
 {

leetcode_helper.py

@@ -621,6 +621,12 @@ def fixbug_for_md():
                     solution_md_data = f.read()
                 if solution_md_data.find('\n\n### after') == -1:
                     solution_md_data = solution_md_data.replace('### after', '\n### after')
+                if solution_md_data.find('### A\n\n```cpp') == -1:
+                    solution_md_data = solution_md_data.replace('### A\n```cpp', '### A\n\n```cpp')
+                if solution_md_data.find('### B\n\n```cpp') == -1:
+                    solution_md_data = solution_md_data.replace('### B\n```cpp', '### B\n\n```cpp')
+                if solution_md_data.find('### C\n\n```cpp') == -1:
+                    solution_md_data = solution_md_data.replace('### C\n```cpp', '### C\n\n```cpp')
 
                 with open(solution_md_path, 'w') as f:
                     f.write(solution_md_data)