update solution.md

data/1.算法初阶/1.蓝桥杯-基础/1.猜年龄/solution.md

@@ -13,6 +13,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/10.分数/solution.md

@@ -5,6 +5,7 @@
 当然，这只是加了前2项而已。分子分母要求互质。  
 
 下面哪一项是<span style="color:red">错误</span>的？
+
 ## aop
 
 ### before
@@ -13,6 +14,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/11.成绩分析/solution.md

@@ -35,6 +35,7 @@
 99
 10
 ```
+
 **样例输出**
 
 ```
@@ -53,6 +54,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp
@@ -83,6 +85,7 @@ int main()
     return 0;
 }
 ```
+
 ## 选项
 
 

data/1.算法初阶/1.蓝桥杯-基础/12.第几个幸运数/solution.md

@@ -22,6 +22,7 @@ x星的国王有个怪癖，他只喜欢数字3,5和7。
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/13.等差素数列/solution.md

@@ -22,6 +22,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/14.乘积最大/solution.md

@@ -64,6 +64,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/15.错误票据/solution.md

@@ -67,6 +67,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/16.猜字母/solution.md

@@ -14,6 +14,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/17.成绩统计/solution.md

@@ -66,6 +66,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/18.次数差/solution.md

@@ -52,6 +52,7 @@ bbccccddaaaacccc
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/2.乘积尾零/solution.md

 # 乘积尾零
 
 如下的10行数据，每行有10个整数，请你求出它们的乘积的末尾有多少个零？
+
 ```
 5650 4542 3554 473 946 4114 3871 9073 90 4329
 2758 7949 6113 5659 5245 7432 3051 4434 6704 3594
@@ -24,6 +25,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/3.大衍数列/solution.md

@@ -2,7 +2,7 @@
 
 中国古代文献中，曾记载过“大衍数列”, 主要用于解释中国传统文化中的太极衍生原理。
 
-它的前几项是：```0、2、4、8、12、18、24、32、40、50 …```
+它的前几项是：`0、2、4、8、12、18、24、32、40、50 …`
 
 其规律是：对偶数项，是序号平方再除2，奇数项，是序号平方减1再除2。
 
@@ -33,6 +33,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/4.递增三元组/solution.md

@@ -47,6 +47,7 @@ C = [C1, C2, ... CN]，
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/5.第几天/solution.md

@@ -10,6 +10,7 @@ y年m月d日是哪一年的第几天。
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/6.方阵转置/solution.md

@@ -22,6 +22,7 @@
 34 76 -54 7
 -4 5 23 9
 ```
+
 **样例输出**
 
 ```
@@ -56,6 +57,8 @@ int main()
 }
 ```
 
+
+
 ## aop
 
 ### before
@@ -63,6 +66,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/7.大数乘法/solution.md

@@ -54,6 +54,7 @@ int main(int argc, char *argv[])
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/8.9数算式/solution.md

 # 9数算式
 
 观察如下的算式：
+
 ```
 9213 x 85674 = 789314562
 ```
+
 左边的乘数和被乘数正好用到了1~9的所有数字，每个1次。
 而乘积恰好也是用到了1~9的所有数字，并且每个1次。
 
@@ -24,6 +26,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/1.蓝桥杯-基础/9.比酒量/solution.md

@@ -13,7 +13,7 @@
 
 格式是：人数,人数,...
 
-例如,有一种可能是：```20,5,4,2,0```
+例如,有一种可能是：`20,5,4,2,0`
 
 以下<span style="color:red">错误</span>的一项是？
 
@@ -25,6 +25,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/2.蓝桥杯-字符串/1.单词分析/solution.md

@@ -50,6 +50,7 @@ o 6
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/2.蓝桥杯-字符串/2.翻硬币/solution.md

@@ -55,6 +55,7 @@ o****o****
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/2.蓝桥杯-字符串/3.分类计数/solution.md

@@ -59,6 +59,7 @@ int main(int argc, char **argv)
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

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

@@ -32,6 +32,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 ```cpp
 

data/1.算法初阶/3.蓝桥杯-递归/1.带分数/solution.md

@@ -52,6 +52,7 @@
 using namespace std;
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/3.蓝桥杯-递归/2.抽签/solution.md

@@ -56,6 +56,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/3.蓝桥杯-递归/3.打印图形/solution.md

@@ -110,6 +110,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/3.蓝桥杯-递归/4.等差数列/solution.md

@@ -77,6 +77,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/3.蓝桥杯-递归/5.斐波那契/solution.md

@@ -46,6 +46,7 @@ Fibonacci数列的递推公式为：Fn=Fn-1+Fn-2，其中F1=F2=1。
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/4.蓝桥杯-堆栈队列链表/1.堆的计数/solution.md

@@ -124,6 +124,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/1.方格填数/solution.md

@@ -14,6 +14,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/10.放棋子/solution.md

@@ -11,6 +11,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/2.等腰三角形/solution.md

@@ -50,6 +50,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/3.承压计算/solution.md

@@ -95,6 +95,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/4.分巧克力/solution.md

@@ -42,6 +42,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/5.颠倒的价牌/solution.md

@@ -21,6 +21,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/6.方程整数解/solution.md

@@ -72,6 +72,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/7.7段码/solution.md

@@ -27,6 +27,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/8.分糖果/solution.md

@@ -39,6 +39,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/5.蓝桥杯-模拟/9.夺冠概率/solution.md

@@ -28,6 +28,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/6.蓝桥杯-搜索/1.大臣的旅费/solution.md

@@ -56,6 +56,7 @@ J大臣想知道：他从某一个城市出发，中间不休息，到达另一
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/6.蓝桥杯-搜索/12.波动数列/solution.md

@@ -41,6 +41,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/6.蓝桥杯-搜索/2.方格分割/solution.md

@@ -20,6 +20,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/6.蓝桥杯-搜索/4.分配口罩/solution.md

@@ -52,6 +52,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/6.蓝桥杯-搜索/5.搭积木/solution.md

@@ -30,6 +30,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/6.蓝桥杯-搜索/6.超级胶水/solution.md

@@ -66,6 +66,7 @@ int main()
 ```cpp
  
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/6.蓝桥杯-搜索/7.第39级台阶/solution.md

@@ -19,6 +19,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/7.蓝桥杯-动态规划/1.测试次数/solution.md

@@ -51,6 +51,7 @@ int main()
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/7.蓝桥杯-动态规划/2.地宫取宝/solution.md

@@ -59,6 +59,7 @@ X 国王有一个地宫宝库，是 n×m 个格子的矩阵，每个格子放一
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/1.算法初阶/7.蓝桥杯-动态规划/4.倍数问题/solution.md

@@ -44,6 +44,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/1.59-螺旋矩阵 II/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/10.48-旋转图像/solution.md

@@ -10,6 +10,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/11.1-两数之和/solution.md

@@ -14,6 +14,7 @@
 #include <map>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/12.54-螺旋矩阵/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/13.80-删除有序数组中的重复项 II/solution.md

@@ -38,6 +38,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/14.56-合并区间/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/15.73-矩阵置零/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/16.74-搜索二维矩阵/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/17.35-搜索插入位置/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/2.81-搜索旋转排序数组 II/solution.md

@@ -40,6 +40,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/3.18-四数之和/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/4.57-插入区间/solution.md

@@ -33,6 +33,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/5.4-寻找两个正序数组的中位数/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/6.78-子集/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/7.33-搜索旋转排序数组/solution.md

@@ -36,6 +36,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/8.15-三数之和/solution.md

@@ -14,6 +14,7 @@
 
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/1.leetcode-数组/9.34-在排序数组中查找元素的第一个和最后一个位置/solution.md

@@ -31,6 +31,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/1.82-删除排序链表中的重复元素 II/solution.md

@@ -18,6 +18,7 @@ struct ListNode
     ListNode(int x) : val(x), next(NULL) {}
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/10.21-合并两个有序链表/solution.md

@@ -20,6 +20,7 @@ struct ListNode
     ListNode(int x, ListNode *next) : val(x), next(next){};
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/2.19-删除链表的倒数第 N 个结点/solution.md

@@ -20,6 +20,7 @@ struct ListNode
     ListNode(int x, ListNode *next) : val(x), next(next){};
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/3.83-删除排序链表中的重复元素/solution.md

@@ -18,6 +18,7 @@ struct ListNode
     ListNode(int x) : val(x), next(NULL) {}
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/4.25-K 个一组翻转链表/solution.md

@@ -17,6 +17,7 @@ struct ListNode
     ListNode(int x, ListNode *next) : val(x), next(next){};
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/5.86-分隔链表/solution.md

@@ -18,6 +18,7 @@ struct ListNode
     ListNode(int x) : val(x), next(NULL) {}
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/6.23-合并K个升序链表/solution.md

@@ -20,6 +20,7 @@ struct ListNode
     ListNode(int x, ListNode *next) : val(x), next(next){};
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/7.92-反转链表 II/solution.md

@@ -18,6 +18,7 @@ struct ListNode
     ListNode(int x) : val(x), next(NULL) {}
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/8.2-两数相加/solution.md

@@ -23,6 +23,7 @@ struct ListNode
     ListNode(int x, ListNode *next) : val(x), next(next){};
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/2.leetcode-链表/9.24-两两交换链表中的节点/solution.md

@@ -20,6 +20,7 @@ struct ListNode
     ListNode(int x, ListNode *next) : val(x), next(next){};
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/1.58-最后一个单词的长度/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/10.28-实现 strStr()/solution.md

@@ -33,6 +33,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/11.97-交错字符串/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/2.93-复原 IP 地址/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/3.8-字符串转换整数 (atoi)/solution.md

@@ -119,6 +119,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/4.38-外观数列/solution.md

@@ -75,6 +75,7 @@ countAndSay(4) = 读 "21" = 一 个 2 + 一 个 1 = "12" + "11" = "1211"
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/5.3-无重复字符的最长子串/solution.md

@@ -12,6 +12,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/6.6-Z 字形变换/solution.md

@@ -60,6 +60,7 @@ P     I
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/7.14-最长公共前缀/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/8.43-字符串相乘/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/3.leetcode-字符串/9.65-有效数字/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/1.227-基本计算器 II/solution.md

@@ -53,6 +53,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/10.42-接雨水/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/2.71-简化路径/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/3.20-有效的括号/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/4.224-基本计算器/solution.md

@@ -45,6 +45,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/5.32-最长有效括号/solution.md

@@ -10,6 +10,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/6.155-最小栈/solution.md

@@ -49,6 +49,7 @@ minStack.getMin();   --> 返回 -2.
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/7.218-天际线问题/solution.md

@@ -52,6 +52,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/8.84-柱状图中最大的矩形/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/4.leetcode-栈与队列/9.150-逆波兰表达式求值/solution.md

@@ -83,6 +83,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/1.493-翻转对/solution.md

@@ -35,6 +35,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/10.378-有序矩阵中第 K 小的元素/solution.md

@@ -43,6 +43,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/2.324-摆动排序 II/solution.md

@@ -46,6 +46,7 @@
 using namespace std;
 
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/3.274-H 指数/solution.md

@@ -45,6 +45,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/4.347-前 K 个高频元素/solution.md

@@ -41,6 +41,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/5.354-俄罗斯套娃信封问题/solution.md

@@ -43,6 +43,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/6.164-最大间距/solution.md

@@ -33,6 +33,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/7.327-区间和的个数/solution.md

@@ -41,6 +41,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/8.912-排序数组/solution.md

@@ -37,6 +37,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/5.leetcode-排序算法/9.315-计算右侧小于当前元素的个数/solution.md

@@ -49,6 +49,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/1.75-颜色分类/solution.md

@@ -12,6 +12,7 @@
 using namespace std;
 
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/2.11-盛最多水的容器/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/3.31-下一个排列/solution.md

@@ -10,6 +10,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/4.142-环形链表 II/solution.md

@@ -71,6 +71,7 @@ struct ListNode
     ListNode(int x) : val(x), next(NULL) {}
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/5.141-环形链表/solution.md

@@ -68,6 +68,7 @@ struct ListNode
     ListNode(int x) : val(x), next(NULL) {}
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/6.61-旋转链表/solution.md

@@ -18,6 +18,7 @@ struct ListNode
     ListNode(int x) : val(x), next(NULL) {}
 };
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/7.26-删除有序数组中的重复项/solution.md

@@ -64,6 +64,7 @@ for (int i = 0; i < len; i++) {
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/8.27-移除元素/solution.md

@@ -66,6 +66,7 @@ for (int i = 0; i < len; i++) {
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/2.算法中阶/6.leetcode-双指针/9.88-合并两个有序数组/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/1.leetcode-树/1.95-不同的二叉搜索树 II/solution.md

@@ -52,6 +52,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

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

@@ -43,6 +43,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/1.leetcode-树/2.100-相同的树/solution.md

@@ -22,6 +22,7 @@ struct TreeNode
 };
 
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/1.leetcode-树/3.124-二叉树中的最大路径和/solution.md

@@ -52,6 +52,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/1.leetcode-树/4.98-验证二叉搜索树/solution.md

@@ -55,6 +55,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/1.leetcode-树/5.96-不同的二叉搜索树/solution.md

@@ -37,6 +37,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/1.leetcode-树/6.99-恢复二叉搜索树/solution.md

@@ -21,6 +21,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

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

@@ -21,6 +21,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

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

@@ -50,6 +50,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

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

@@ -45,6 +45,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/2.leetcode-哈希表/1.30-串联所有单词的子串/solution.md

@@ -18,6 +18,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -64,6 +64,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/2.leetcode-哈希表/2.205-同构字符串/solution.md

@@ -45,6 +45,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/2.leetcode-哈希表/3.36-有效的数独/solution.md

@@ -57,6 +57,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/2.leetcode-哈希表/4.41-缺失的第一个正数/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/2.leetcode-哈希表/5.76-最小覆盖子串/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/2.leetcode-哈希表/6.49-字母异位词分组/solution.md

@@ -18,6 +18,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -58,6 +58,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -51,6 +51,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -39,6 +39,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/3.leetcode-图与搜索/1.77-组合/solution.md

@@ -13,6 +13,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -43,6 +43,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/3.leetcode-图与搜索/2.133-克隆图/solution.md

@@ -102,6 +102,7 @@ public:
     }
 };
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/3.leetcode-图与搜索/3.332-重新安排行程/solution.md

@@ -50,6 +50,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/3.leetcode-图与搜索/4.207-课程表/solution.md

@@ -48,6 +48,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/3.leetcode-图与搜索/5.329-矩阵中的最长递增路径/solution.md

@@ -49,6 +49,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/3.leetcode-图与搜索/6.210-课程表 II/solution.md

@@ -67,6 +67,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/3.leetcode-图与搜索/7.79-单词搜索/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -57,6 +57,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

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

@@ -62,6 +62,7 @@ struct TreeNode
 };
 
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/1.29-两数相除/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/10.60-排列序列/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/2.12-整数转罗马数字/solution.md

@@ -79,6 +79,7 @@ M             1000</pre>
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/3.50-Pow(x, n)/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/4.9-回文数/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/5.66-加一/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/6.7-整数反转/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/7.67-二进制求和/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/8.69-x 的平方根/solution.md

@@ -17,6 +17,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/4.leetcode-数学/9.13-罗马数字转整数/solution.md

@@ -79,6 +79,7 @@ M             1000</pre>
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/5.leetcode-设计/1.355-设计推特/solution.md

@@ -54,6 +54,7 @@ twitter.getNewsFeed(1);  // 用户 1 获取推文应当返回一个列表，其
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -65,6 +65,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/5.leetcode-设计/2.380-O(1) 时间插入、删除和获取随机元素/solution.md

@@ -58,6 +58,7 @@ randomizedSet.getRandom(); // 由于 2 是集合中唯一的数字，getRandom
 using namespace std;
 
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/5.leetcode-设计/3.381-O(1) 时间插入、删除和获取随机元素 - 允许重复/solution.md

@@ -44,6 +44,7 @@ collection.getRandom();
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/5.leetcode-设计/4.460-LFU 缓存/solution.md

@@ -71,6 +71,7 @@ lFUCache.get(4);      // 返回 4
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/5.leetcode-设计/5.146-LRU 缓存机制/solution.md

@@ -63,6 +63,7 @@ lRUCache.get(4);    // 返回 4
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -77,6 +77,7 @@ struct TreeNode
     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 ```
+
 ### after
 
 ```cpp

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

@@ -52,6 +52,7 @@ trie.search("app");     // 返回 True
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -15,6 +15,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -74,6 +74,7 @@ public:
     const vector<NestedInteger> &getList() const;
 };
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/1.22-括号生成/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/10.63-不同路径 II/solution.md

@@ -33,6 +33,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/11.70-爬楼梯/solution.md

@@ -12,6 +12,7 @@
 using namespace std;
 
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/12.44-通配符匹配/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/13.87-扰乱字符串/solution.md

@@ -69,6 +69,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/2.64-最小路径和/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/3.91-解码方法/solution.md

@@ -37,6 +37,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/4.10-正则表达式匹配/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/5.5-最长回文子串/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/6.53-最大子序和/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/7.62-不同路径/solution.md

@@ -29,6 +29,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/8.72-编辑距离/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/6.leetcode-动态规划/9.85-最大矩形/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/1.40-组合总和 II/solution.md

@@ -22,6 +22,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/10.51-N 皇后/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/2.52-N皇后 II/solution.md

@@ -44,6 +44,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/3.90-子集 II/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/4.89-格雷编码/solution.md

@@ -18,6 +18,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/5.47-全排列 II/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/6.17-电话号码的字母组合/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/7.39-组合总和/solution.md

@@ -30,6 +30,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/8.46-全排列/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/7.leetcode-回溯算法/9.37-解数独/solution.md

@@ -60,6 +60,7 @@
 ```cpp
 
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/8.leetcode-贪心/1.122-买卖股票的最佳时机 II/solution.md

@@ -52,6 +52,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -36,6 +36,7 @@
 using namespace std;
 
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/8.leetcode-贪心/2.45-跳跃游戏 II/solution.md

@@ -17,6 +17,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/8.leetcode-贪心/3.68-文本左右对齐/solution.md

@@ -73,6 +73,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/8.leetcode-贪心/4.135-分发糖果/solution.md

@@ -39,6 +39,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/8.leetcode-贪心/5.55-跳跃游戏/solution.md

@@ -11,6 +11,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

data/3.算法高阶/8.leetcode-贪心/6.134-加油站/solution.md

@@ -57,6 +57,7 @@ cost = [3,4,3]
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -52,6 +52,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -38,6 +38,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

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

@@ -43,6 +43,7 @@ k = <code>3</code>
 #include <bits/stdc++.h>
 using namespace std;
 ```
+
 ### after
 
 ```cpp

leetcode_helper.py

@@ -594,6 +594,40 @@ def add_config_export_for_lanqiao_backup():
             f.write(config_data_json)
 
 
+def fixbug_for_md():
+    count = 0
+
+    dirs = ['data/2.算法中阶', 'data/3.算法高阶', 'data/1.算法初阶']
+    exercises_ids = []
+    for dir in dirs:
+        dirs_ = os.listdir(dir)
+        algo_floor_dirs = []
+        for algo_floor_dir in dirs_:
+            leetcode_class_dir = os.path.join(dir, algo_floor_dir)
+            if os.path.isdir(leetcode_class_dir):
+                algo_floor_dirs.append(leetcode_class_dir)
+        
+        for algo_floor_dir in algo_floor_dirs:
+            exercises_dirs_ = os.listdir(algo_floor_dir)
+            exercises_dirs = []
+            for exercises_dir_ in exercises_dirs_:
+                exercises_dir = os.path.join(algo_floor_dir, exercises_dir_)
+                if os.path.isdir(exercises_dir):
+                    exercises_dirs.append(exercises_dir)
+            for idx, tem_dir in enumerate(exercises_dirs):
+                print(tem_dir)
+                solution_md_path = os.path.join(tem_dir, 'solution.md')
+                with open(solution_md_path, 'r') as f:
+                    solution_md_data = f.read()
+                if solution_md_data.find('\n\n### after') == -1:
+                    solution_md_data = solution_md_data.replace('### after', '\n### after')
+
+                with open(solution_md_path, 'w') as f:
+                    f.write(solution_md_data)
+
+
+
+
 if helper_function == 'count_tag_class':
     count_tag_class()
 if helper_function == 'count_exercises':
@@ -603,11 +637,14 @@ if helper_function == 'modify_back_up_dir_name':
 
 
 
-add_solution_md_template_for_lanqiao()
+# add_solution_md_template_for_lanqiao()
+
+# add_color_for_special_exercises()
+
 
-add_color_for_special_exercises()
 
 
+fixbug_for_md()
 
 # check_exercises_is_duplicate()