diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/1.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/1.exercises/solution.json"
index 447ddf92bedd4e7ceb9563dfff053f0441166190..69f42cd3694e08aa38eb3d9271fad9d03fccc3b1 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/1.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/1.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "chinachenlu",
   "source": "solution.md",
   "exercise_id": "2081a5fe4b7a48a19ee2cbab00388ec7",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/10.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/10.exercises/solution.json"
index 6235cd070bfb4f9af024a96546241de0d4c113f0..ef4e80113ac3e8407bbb39cef61c4e1911de03ba 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/10.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/10.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Flyyyy_",
   "source": "solution.md",
   "exercise_id": "18d1a3976bb4424bb4d8fae27a8de3f5",
   "keywords": "算法初阶,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/11.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/11.exercises/solution.json"
index 321d5336986690c0f29163a13d0b4db6ccf357ec..10947a2d605e3e459ebfaa9cf02d2f0d09b712aa 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/11.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/11.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Skyiing",
   "source": "solution.md",
   "exercise_id": "07b64188801e410c82dbb0a4cfe65013",
   "keywords": "算法初阶,基础知识,特征序列,概率分析和随机算法,概率分析和指示器随机变量的进一步使用"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/12.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/12.exercises/solution.json"
index 0aa9ff89602e71444d02f14594b44018afd0503c..308425d3005067bd08e8abffbb832da11b765c07 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/12.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/12.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32565003",
   "source": "solution.md",
   "exercise_id": "c6e88d96e04c4bbb91106f400c99f436",
   "keywords": "算法,图形输出"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/13.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/13.exercises/solution.json"
index a89613feeebd6830494fe87ddd77110b8a24b502..b0992d59515560f77513262289041ee08c0a4749 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/13.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/13.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32517277",
   "source": "solution.md",
   "exercise_id": "f3be7867de2e4a7a9b1fc61f0e02dd2b",
   "keywords": "算法中阶,动态规划,最长公共子序列,高级设计和分析技术"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/14.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/14.exercises/solution.json"
index e5a796d18518f9267bd3270e7fba95a34eb50f4e..6bf0330e0f1e22bf3d8657dbde20360d7b0ac8fc 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/14.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/14.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_41208975",
   "source": "solution.md",
   "exercise_id": "2c345d38dc4f44148223b82cb0200bc2",
   "keywords": "算法初阶,基础知识,分治策略,证明主定理,对b的幂证明主定理"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/15.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/15.exercises/solution.json"
index 2a72eebf061845409bd3eb5edf1c8f445e944fb7..9e221b9eaed8e7f909ea9230cfa35f7d72ab359e 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/15.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/15.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "android_wjq",
   "source": "solution.md",
   "exercise_id": "ec24de171a30438d807712d827454a63",
   "keywords": "数学运算"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/16.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/16.exercises/solution.json"
index d0bb143aef8fefc29312893c481b59f4515fd25f..5aa045b54da75e479fe395d45ec72230a7c07c89 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/16.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/16.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_17608345",
   "source": "solution.md",
   "exercise_id": "3dc7b8659623455cbb5edb5d911490b5",
   "keywords": "算法高阶,数论算法,元素的幂,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/17.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/17.exercises/solution.json"
index 007a09238cbccf7f5c7290c38d3d0ab691f50fc6..21dc26c15801f12ed2fa17d9a31449fab3e35e7c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/17.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/17.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "onlyformyself",
   "source": "solution.md",
   "exercise_id": "75135d3d50e04fb1b179a3bccaff8095",
   "keywords": "算法初阶,排序和顺序统计量,中位数和顺序统计量,期望为线性时间的选择算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/19.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/19.exercises/solution.json"
index 807c0f1335e6ece95666d8156fb1eed9a4b35c2b..adbacfeb8c596ef0c779de8d5a0bb56c424a01d3 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/19.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/19.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Harry_Kuma",
   "source": "solution.md",
   "exercise_id": "cd1c7b8656184bc182464888f93f178a",
   "keywords": "算法初阶,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/2.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/2.exercises/solution.json"
index 7cdde92d987031aee32d93a901c22d8bc06f016d..872a4138e4faeb0949ad3368a67d478c93228669 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/2.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/2.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "dmcff",
   "source": "solution.md",
   "exercise_id": "337b3f0460f140e0a2e1984f78f1cbb2",
   "keywords": "算法初阶,基础知识,算法基础,设计算法,分析分治算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/20.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/20.exercises/solution.json"
index f33e4a3f17e86a8538ad651cd8df90e88e64e253..03e363739cc46975b469597669465a0159af1034 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/20.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/20.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "ts12009",
   "source": "solution.md",
   "exercise_id": "37e3b85ac0fd4586ae7e18a4cac5a70f",
   "keywords": "算法高阶,计算几何学,算法问题选编,确定任意一对线段是否相交"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/21.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/21.exercises/solution.json"
index eb2f64e093e9a8becb291a819992162885b7842c..5b8cf11c6dd46be63da602dd6fb5054caac1a2cd 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/21.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/21.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "hnwzjcds",
   "source": "solution.md",
   "exercise_id": "bb8ae5765727421eb08c5de7e9699fc3",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/23.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/23.exercises/solution.json"
index 19c27de9114101c8aed744bd69b5a28d31087e27..6b7ab6d662c44932cd72a3c1e40db6d30511eaaf 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/23.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/23.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45782465",
   "source": "solution.md",
   "exercise_id": "43b13523e05540b7a3e1315f981d47af",
   "keywords": "算法初阶,基础知识,函数的增长,标准记号与常用函数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/24.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/24.exercises/solution.json"
index 23d6a7ba1409828af67aa23661569e1816aa8316..db38d5b0cb31b5b12142a69825c2a82ea58a427d 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/24.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/24.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "zqgx1990",
   "source": "solution.md",
   "exercise_id": "74677d031c15454ba08620f7584d319c",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/25.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/25.exercises/solution.json"
index a84e18d007a6c10fe72e7ca184f81d0d88772663..8fdcda8492046df1526688f29305c203940a9c95 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/25.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/25.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32871159",
   "source": "solution.md",
   "exercise_id": "261703b256274305a629bee39fa0a25d",
   "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/26.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/26.exercises/solution.json"
index 8b598f3aad49df7c91461f6f858b93e0a10e5396..8d5a3eabaeebd36301b243804c4889bf5358e910 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/26.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/26.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "naiyitian",
   "source": "solution.md",
   "exercise_id": "952b11e4fca244409f82bc96502ffaf6",
   "keywords": "数学,算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/27.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/27.exercises/solution.json"
index 83fee9c172f325ddce8f3b5c75a7799f0ef70945..1c27386dcc72790ce9b674366c9a5145652d108c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/27.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/27.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq675032915",
   "source": "solution.md",
   "exercise_id": "6b4490cf046f4376a882eef5bda4d59a",
   "keywords": "时间转换"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/29.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/29.exercises/solution.json"
index e1ea604198bafb157032199ddf89f3d51903c09d..9f9bd8d55f9809622fadd3a0f10bb808be44452c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/29.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/29.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "bonze1023",
   "source": "solution.md",
   "exercise_id": "a27288a39f4b4bcb96316f366f386b4f",
   "keywords": "算法初阶,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/3.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/3.exercises/solution.json"
index d019e89672b6304d7f9ec3d2b4bf006ab25779e4..105b364cf425338baefbcc7f3f5d3a1c2886d4b1 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/3.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/3.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "m0_45801658",
   "source": "solution.md",
   "exercise_id": "926861f9153c43fbb4b93e5ee1ec2d2a",
   "keywords": "算法中阶,贪心算法,活动选择问题,高级设计和分析技术"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/30.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/30.exercises/solution.json"
index dbf963d332007c4b95f30239ba12f0adc8b82728..66e62a2962fdfd3a5434c12dda804a82bddb2246 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/30.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/30.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45814103",
   "source": "solution.md",
   "exercise_id": "8517fe2b3ab94ebfaefe815949da2d20",
   "keywords": "数列,递归,数学运算"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/31.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/31.exercises/solution.json"
index 51d63ce177e3596b0cb9854b6b7f3254987a52dc..06645d161942046fc4b99d106b7e86bee6e56f71 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/31.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/31.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "tanglei25",
   "source": "solution.md",
   "exercise_id": "97926ffce4134ed2a2317cfdd0378175",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/32.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/32.exercises/solution.json"
index 0813f8ae5c50749006d9b38738613995d5b9aba8..f6d719f001086ca51b7fab7025318e0207064492 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/32.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/32.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Cruel_xu",
   "source": "solution.md",
   "exercise_id": "2b2ef20f0be545bf89115f683d131db8",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/33.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/33.exercises/solution.json"
index 385d2fba5d05d57659f51d73e03144516933f493..60fef4199dd3091ee690a7d36a4335286e111ee6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/33.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/33.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Dorispt",
   "source": "solution.md",
   "exercise_id": "6ce02858aefa4a0ea1909954c57ce3b2",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/34.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/34.exercises/solution.json"
index af55105d7dcd55dcf33f0313e5fe8bdde2307787..18d1aaa2bbcf68ad9f54c488c6dd30c5bc9cd4a3 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/34.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/34.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45128830",
   "source": "solution.md",
   "exercise_id": "021cb62e7da84d569ace7e3036cb19c5",
   "keywords": "递归,算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/35.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/35.exercises/solution.json"
index 408f137158b7b83793efa60506fb478fc255f58e..b2bd14db1efa55bf6e1365142c9e9402dc77d66b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/35.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/35.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "xushao180",
   "source": "solution.md",
   "exercise_id": "ce9c2b5715b9442288e0e56552087acf",
   "keywords": "数列,数学运算"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/36.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/36.exercises/solution.json"
index 52ba0878c2c4fa799b3e58d4080cf3171e77f9cf..99b74f2f01667961859cdf51c581a77b404c0db3 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/36.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/36.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "zzzqql",
   "source": "solution.md",
   "exercise_id": "89d9e179bea44370ab0c829bb40b6b76",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/37.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/37.exercises/solution.json"
index 94cb2f6402a34fc00addd930d78ecd71041af75c..6c7726882b07de25972de50ffaa619a33b95ac18 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/37.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/37.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "xsl2516847663",
   "source": "solution.md",
   "exercise_id": "a9b93d1decbc46a0b40aa01f35b02ea3",
   "keywords": "循环"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/38.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/38.exercises/solution.json"
index 049aeabf6731290462408b12acd51421a7b554d9..68ae8eda3a594835f0b8d402beed57afc3d64558 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/38.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/38.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "stelladragon",
   "source": "solution.md",
   "exercise_id": "2643e10921c54ac283bdb73499243c5d",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/39.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/39.exercises/solution.json"
index cfe758e9f365deb63b804f9c17342a617d261807..88f9ddfd39f6687fb3d9b5b21722eafa833aaa92 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/39.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/39.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "feiniao2029",
   "source": "solution.md",
   "exercise_id": "470a59d0ed744d55b36a9fbe8ed76198",
   "keywords": "数列"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/4.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/4.exercises/solution.json"
index 1756d1d53f1981df2926c2a85f9bdee794b35d85..3e04efbbde22c07e4be7ee0f63192afb2b062119 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/4.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/4.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_44563215",
   "source": "solution.md",
   "exercise_id": "7b5fba1ab1d24fc086a730fc23772c43",
   "keywords": "质数,数学运算"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/40.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/40.exercises/solution.json"
index 6807bd8a506bc2e43051f825f9fda2f0375ed9b6..d4f8b90936f41bb7ed91c82d2a91f76cac386d86 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/40.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/40.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "zhangxiaox",
   "source": "solution.md",
   "exercise_id": "9e99f632c7254a3386832c055749196f",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/41.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/41.exercises/solution.json"
index 409c383274003d94a8f2e8028540a91dce9e1773..a0b733744bcc0b73612f9d7212f533ff7e5b2ce4 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/41.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/41.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45817480",
   "source": "solution.md",
   "exercise_id": "1cc2af8b030c41f687a7d0308bcbd9be",
   "keywords": "算法初阶,基础知识,函数的增长,标准记号与常用函数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/42.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/42.exercises/solution.json"
index 3c2cdf2627f841349e5765d78aaa2ec62429faee..1d83a7f334efdb100efa41e32088a661e9796d4b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/42.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/42.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Funtional",
   "source": "solution.md",
   "exercise_id": "93aef0d373dc44f58c0097b772693f6f",
   "keywords": "算法高阶,矩阵运算,矩阵求逆,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/43.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/43.exercises/solution.json"
index 6fc15f2e9bad8dee056f02fb9440c1d470437fdb..efeb317b4117122d962debdc7c7f77bc0d23dba6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/43.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/43.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "l990308",
   "source": "solution.md",
   "exercise_id": "a691200feb064addb5299c796864fb54",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/44.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/44.exercises/solution.json"
index 7a70dcc38d5a9511f1f87436e3ed0c696457b11e..41e4f1d26a82eb8f559e0a730135d1717ab61888 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/44.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/44.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "xigua123321",
   "source": "solution.md",
   "exercise_id": "0f46f7cc63a64195a69ecf894966c670",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/45.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/45.exercises/solution.json"
index b86b706899c1af93df1d4df7a054ef639a80c5b4..5d4575986081e6f6d9d64896f0df6a06925f8c3b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/45.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/45.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45096552",
   "source": "solution.md",
   "exercise_id": "3a4cd3d0b4984206a8894f5a5a5f8698",
   "keywords": "区间树,算法中阶,数据结构,数据结构的扩张"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/46.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/46.exercises/solution.json"
index 4277a154df387ed029c69e45201fa34c945fa371..8638909c78451b7e9a0518631c94fbf64b15d2d0 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/46.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/46.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "xi2247",
   "source": "solution.md",
   "exercise_id": "2868e7b62db247d8b3800d43ebff571b",
   "keywords": "算法高阶,数论算法,素数的测试,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/47.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/47.exercises/solution.json"
index 015685d71cce5b6784dc36c0c9fcd4956081ae2e..b648234ec2603d034bfe7f2429ad2bbc81831a9b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/47.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/47.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "xinning0702",
   "source": "solution.md",
   "exercise_id": "0a56db6452f24e50933fff9480245e2f",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/48.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/48.exercises/solution.json"
index eb278b07225e2c84ccc9fd17fcb8d393809408d8..6815faf21d90415b18a302e91f9dd085f435b52f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/48.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/48.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "taowei0210",
   "source": "solution.md",
   "exercise_id": "2ba1fb6b11e2484ab4d3b77e77e71f5e",
   "keywords": "算法初阶,快速排序,快速排序的描述,排序和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/49.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/49.exercises/solution.json"
index 21605219c687366e0e8d72b98934ca5876c9d534..7f04ab84cd74452c8fe29e7346c8cb23c4c5da97 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/49.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/49.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_16109091",
   "source": "solution.md",
   "exercise_id": "784938343cda4c629b52000ba7981f24",
   "keywords": "数学运算"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/5.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/5.exercises/solution.json"
index 26d52a80a9eac5a6b9c44e8d09f062a2e0ceab75..281d020009632c9569a24dcd87edfd2b1e449c42 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/5.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/5.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "sinat_25061079",
   "source": "solution.md",
   "exercise_id": "a13a0ee7f65e4635847c39aa35ad12dd",
   "keywords": "算法初阶,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/50.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/50.exercises/solution.json"
index f2854b1ebf808d67561c12f496de67a3a563318a..d0dcce870bd9b144f5c6fbd07cf70aced82af4da 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/50.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/50.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_22635249",
   "source": "solution.md",
   "exercise_id": "64cdf149702648d08e72882e5a4b194e",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/51.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/51.exercises/solution.json"
index 85885a6b30e9e6fb4c406ebbf14e403813ff633b..61412b2b5341f4223e3e8fb34ab281843efeef15 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/51.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/51.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_42023987",
   "source": "solution.md",
   "exercise_id": "3d029d11c3e84465a0a62b1e960cc2bb",
   "keywords": "算法高阶,数论算法,算法问题选编,RSA公钥加密系统"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/53.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/53.exercises/solution.json"
index b8c478110e9538ceabafe86fd2c6e7d192b0a705..5cded29a4037421b8a91595e201caeaf89129145 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/53.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/53.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "wshaipsy",
   "source": "solution.md",
   "exercise_id": "7a01b1256de14c1b8ad5e331d1fae735",
   "keywords": "算法高阶,矩阵运算,矩阵求逆,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/54.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/54.exercises/solution.json"
index c665f728cadeac09353f1b51e01584dc74d17148..b9b72518e038d1e12a3cf11669b60c7bb4787919 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/54.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/54.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32654125",
   "source": "solution.md",
   "exercise_id": "5d8658bd3bf54a3eb80aa8073f45ff9b",
   "keywords": "动态表,表扩张,算法中阶,摊还分析,高级设计和分析技术"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/55.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/55.exercises/solution.json"
index e9b38a74c2b394ed19018c39d8957331ff7c77b6..bd521481d3a8d4e03d93684a47948ef66c5c5347 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/55.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/55.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45777679",
   "source": "solution.md",
   "exercise_id": "d421a78bd062493383fff7b3dbb32b05",
   "keywords": "递归,数学运算"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/56.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/56.exercises/solution.json"
index 3dbf69ad41d8d725c1010d7d3f48baf4fd1f884b..dcdc76497cbbdfcc8d6835aa9455835f7fe0c166 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/56.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/56.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "hp_innovation",
   "source": "solution.md",
   "exercise_id": "3fa9f3d1423842008b789a377afdbab8",
   "keywords": "算法初阶,基础知识,函数的增长,标准记号与常用函数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/57.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/57.exercises/solution.json"
index 596724c33d2ba2a7447290a2e036fdb1498a0e49..16133c5d621503d305820c0ad7e0b224a0b4b90f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/57.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/57.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "lionta2014",
   "source": "solution.md",
   "exercise_id": "dc4363e2790746529e70010a643e343d",
   "keywords": "算法初阶,基础知识,随机算法,概率分析和随机算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/58.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/58.exercises/solution.json"
index 5b1870465b6be943fbe8ea1ffe8a9e750a407364..6dd7c76c896380797a0cfd8df3a85fca39c52933 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/58.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/58.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_43254190",
   "source": "solution.md",
   "exercise_id": "ca289aac5d3144f4a33a3588d91c49b2",
   "keywords": "算法初阶,最小值和最大值,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/59.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/59.exercises/solution.json"
index 35bcd7adbe81a19178aada1997c5fa85bba1a5dc..0890784f111baa820abdfe55d7982ed6b6778e13 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/59.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/59.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "conris",
   "source": "solution.md",
   "exercise_id": "ce51c2a42ff44e23a4ff61e60774103f",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/6.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/6.exercises/solution.json"
index 3b099adf5044dfc323b6d0fbfb6078c8f84676ca..905feb01907b99afc806d22a79be1ba0779c992c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/6.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/6.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45813653",
   "source": "solution.md",
   "exercise_id": "103703df56b7460dbd9c5dde44d37af0",
   "keywords": "算法高阶,计算几何学,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/60.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/60.exercises/solution.json"
index 835f1a0078adb0551b9adf02fac1e47dcf1104d8..5f571b7855c715a999d2f7f11b3ed3bfdc820f4f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/60.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/60.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45766327",
   "source": "solution.md",
   "exercise_id": "026cef91deb8490fbdfefb164bf020bf",
   "keywords": "算法初阶,基础知识,函数的增长,标准记号与常用函数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/61.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/61.exercises/solution.json"
index e74d3f4e9a41d74756f2033d384a5aa19fe0ab6a..5e8d5c18f2bbd488b68ec784c8b6b2c30a25431b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/61.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/61.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "zhanjiaming",
   "source": "solution.md",
   "exercise_id": "76e7efc2f3e348388926bb242343fcfe",
   "keywords": "回文,数学运算"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/62.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/62.exercises/solution.json"
index 03370110d0125379a1f880680f5f8efa1f5618bc..0a053175e26fbf9864866d27bfad3cd40c458fe7 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/62.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/62.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45804463",
   "source": "solution.md",
   "exercise_id": "42b687b25f34427f9645a1c027620a59",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/63.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/63.exercises/solution.json"
index 1cb1ca6d7f027727560df955fa7403832ba711d6..786b9d3ef35fe3e7d8c4603cffdc95213a2fcb9e 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/63.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/63.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "ufo27954285",
   "source": "solution.md",
   "exercise_id": "25fe83471079488494b2a35897a7ea41",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/65.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/65.exercises/solution.json"
index 2dd71d9391e024b4533f758e32c5e375b73fc8b8..5fb1fd4a924f62a02411263dbe3cb09fb1a16dab 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/65.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/65.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "gechenyilie",
   "source": "solution.md",
   "exercise_id": "63b2c8d6c3c34455b52e21d95fa44aa0",
   "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/66.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/66.exercises/solution.json"
index 965fbd5142cac799b1920b84d1a9bd14a2e890c9..bf1f5084f589bba2c7655a5e4171b18ea155414b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/66.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/66.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "fulei1360",
   "source": "solution.md",
   "exercise_id": "ccf7bb16723845fdafd5fd69f2126f29",
   "keywords": "算法高阶,计算几何学,算法问题选编,确定任意一对线段是否相交"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/67.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/67.exercises/solution.json"
index 19de240d9c8c96e61204f1943af70cd10f8b4b1a..285aee390ac207e96c84ec11f148c85b2910f99f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/67.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/67.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_41623858",
   "source": "solution.md",
   "exercise_id": "2cc2ae38392241ae8d76871eb39bd102",
   "keywords": "算法初阶,快速排序,快速排序的描述,排序和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/68.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/68.exercises/solution.json"
index 943fd4f3aa95e68376ffe5c6499ed8a8b0ccb115..d3fd81757e8f4273ddb6c99dacf263b56b4c07af 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/68.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/68.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "superyiran",
   "source": "solution.md",
   "exercise_id": "f29824db6c66441296e9fa9229ae8e23",
   "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/69.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/69.exercises/solution.json"
index 71efbb38173108177010cf3a31a0976c952ddc76..2cde30e4d2e79e8ba51557ef6a0a7ccce22796c5 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/69.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/69.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Ediwords",
   "source": "solution.md",
   "exercise_id": "732171fffb8b4f5bbec5f92aa7425b3e",
   "keywords": "算法初阶,基础知识,函数的增长,标准记号与常用函数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/7.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/7.exercises/solution.json"
index 5b159ce0e6f7b680b927105f6b9b071f1d7b7e5d..2b7a4122371a4d7043243efba37e71ff65db95a9 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/7.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/7.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_41219571",
   "source": "solution.md",
   "exercise_id": "1ecf2a2118ca48b59e5eaaf8df2c0a2a",
   "keywords": "算法高阶,递归结构,高级数据结构,van Emde Boas树,原型van Emde Boas结构"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/71.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/71.exercises/solution.json"
index 692f74232498886a80a110a1b784a7fc71d443f1..19248c8e8c70bdacf350766ed39781db96a8a270 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/71.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/71.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_28532949",
   "source": "solution.md",
   "exercise_id": "40a27b38addc4fd49fc7e11b732d690b",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/73.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/73.exercises/solution.json"
index 7b5a734ea39323493334e3a2fde9e666a3556bcc..bfe95750f5da9d64f2fd59a1756275bbb6189ae0 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/73.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/73.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "worldzp",
   "source": "solution.md",
   "exercise_id": "e2f076d8948c4d889c4350d98a9aa7cd",
   "keywords": "算法初阶,基础知识,算法基础,设计算法,分析分治算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/74.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/74.exercises/solution.json"
index 90c3c9e67ed4927f4a6a148b2c14da2561f94a37..d1f9e0ddc6c56ea503b34583d780162d6acc2f41 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/74.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/74.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "u011093126",
   "source": "solution.md",
   "exercise_id": "462fb7f7f607424488dab204267caa1d",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/75.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/75.exercises/solution.json"
index 3b5159d1d9e73ef995fbb64adfd0c11fa2143925..b651f0418ccb52afbec10f0c52076a5460496ebe 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/75.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/75.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "help_123_cnm",
   "source": "solution.md",
   "exercise_id": "d8b00b5b1ce84bcc8d20180a7372a780",
   "keywords": "算法初阶,最小值和最大值,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/76.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/76.exercises/solution.json"
index adb2b1c2a63abd1be2039cd792a4f7be397fc790..3a3c379c7db76f253ee27d2218d3e52de12ddc9f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/76.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/76.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45750218",
   "source": "solution.md",
   "exercise_id": "91f425ad15174f85978143e8db3ae5f6",
   "keywords": "数学,三角形"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/77.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/77.exercises/solution.json"
index 0739916a464b836ad0a8ce74fb78481765a87d9c..c803b4cdda013141ca34a6127a9bbcd62f73eaa8 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/77.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/77.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "baidu_25275979",
   "source": "solution.md",
   "exercise_id": "aa7fe92bbd9b4b039034264e025596fd",
   "keywords": "算法初阶,基础知识,随机算法,概率分析和随机算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/79.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/79.exercises/solution.json"
index 4db56a04a41320a3bdc118e31e6333fdd305aeef..47487b197af957a5cb6fb80cdf355690b0c7d86f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/79.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/79.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "a32346e4fd59416c86e6fa9fabaa217a",
   "keywords": "字符串"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/8.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/8.exercises/solution.json"
index 743bd27a3191481853980ca877dbce245f546a4f..5a9625c663a547e5fbbcddf721653ab99b8e895f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/8.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/8.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "smilehat",
   "source": "solution.md",
   "exercise_id": "9dc91baa80a849b283cfd7d314ec0882",
   "keywords": "算法高阶,数论算法,素数的测试,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/80.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/80.exercises/solution.json"
index 45e120612c371a8268af1316c21ef6ce01ae2d06..43a16deb5ef28b5bf6d6197a9212b2314616ac67 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/80.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/80.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "116a55fde6804d0597746cde94acd17e",
   "keywords": "链表"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/82.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/82.exercises/solution.json"
index ab3a6f7b7378f23c7408047e0023cc003a40a8fa..3c444ff25dbeef20c48953c794b35a7893b83b0d 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/82.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/82.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "3dab732122934bb1b85db4da70e5f921",
   "keywords": "树,深度优先搜索,广度优先搜索,二叉树"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/84.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/84.exercises/solution.json"
index 757200133c78aa8e57c2a1719b2c1addf2b70b28..c117b948348c4e06b9dae6e028997b2fb376e713 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/84.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/84.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "92e577553712419db2d534bfbd18736a",
   "keywords": "数组,双指针"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/85.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/85.exercises/solution.json"
index 77dfdb8dd3140ba0754909a3a381a050624fe7e4..73438138372384e67c1357f4e17be0f1d55278f4 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/85.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/85.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "06b1f69f839848c8ba12203ff5b602cc",
   "keywords": "位运算,数学,字符串,模拟"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/86.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/86.exercises/solution.json"
index 02ee82459431f7868bb34434d2dab188ed5e4c71..7c4fb0e54be4f88b2755ae02f3a282bceed11be9 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/86.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/86.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2bb10d9cca474fc09519c3f275b27a15",
   "keywords": "栈,树,深度优先搜索,二叉树"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/87.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/87.exercises/solution.json"
index d043b9f280c4721c68e5d97aa7e093e5da69c0e5..a39962efb41e986eca9d137e1f4263fa8be13e8f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/87.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/87.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "e39ca369150f4f62949d81a9701a1399",
   "keywords": "记忆化搜索,数学,动态规划"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/89.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/89.exercises/solution.json"
index a2daf06fe981170afb36e0184da1d44bf52aae8c..bade46706af1e18b0f4381740c70a16a3eed1102 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/89.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/89.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "3e790bfc8db24efb9e633e09abfa98b4",
   "keywords": "数组,数学"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/9.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/9.exercises/solution.json"
index d1daaaa20ae343a40e136abcb7d4d4358b28fb4f..40b77d3692f424ae08a1bdf7abfa07b57576fe18 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/9.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/9.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45809205",
   "source": "solution.md",
   "exercise_id": "e4e50444317049bab4a6f63b3f631c59",
   "keywords": "算法高阶,计算几何学,算法问题选编,寻找最近点对"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/90.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/90.exercises/solution.json"
index 9e20391b58524db0a3a69beb609ce876440f7d2f..64493601a016a9a9141aea4c9c3447bb77b05a85 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/90.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/90.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "5711d8373ceb4bf792674b48470a992f",
   "keywords": "数组,双指针"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/92.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/92.exercises/solution.json"
index 335da8f0690fcff2aa8ec14a5b0a2cdd7530e3c3..72b6c0c0fa9e067f64da36dd26b27a147a2f3cae 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/92.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/92.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1227f881a77741199e38d9fa69318778",
   "keywords": "数组,分治,动态规划"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/93.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/93.exercises/solution.json"
index 5bc68085df9420f5b3351a0e04f282ded20dbbfa..46e984406f373d9ce937cd67d2582af2d80470e6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/93.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/93.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "3b5534cc405947d595b17441f3433545",
   "keywords": "数学,二分查找"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/94.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/94.exercises/solution.json"
index d89ff3fe840f2fdee635c701e0531d17ad9675a2..2771539b553859a2b620373b6464c86d43550638 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/94.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/94.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "dc0bf68a76dc453a868c0a58681e3d5a",
   "keywords": "数组,双指针,排序"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/95.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/95.exercises/solution.json"
index c388fd470060fa3faac497c19dd69a108f7af61f..76f23079233b506101c9bd4f0551b4d87ab917fb 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/1.cpp/95.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/1.cpp/95.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2a48f3f173ad4d5eb687f2b17a53d8ac",
   "keywords": "数组,二分查找"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/1.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/1.exercises/solution.json"
index 4001760e47e9da5130a35e781e073632d9fbea55..a2ae974a6e9ae12c74f187f4858914838e1ce080 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/1.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/1.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_30332037",
   "source": "solution.md",
   "exercise_id": "db433b9b23c3428da71be4db3d42bd7a",
   "keywords": "算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/10.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/10.exercises/solution.json"
index 1aa36b93f7408d230f84aaade2ea5e98b8ad7876..0f5de86dcb9f746081b82ed143194e9170edd9a3 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/10.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/10.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "hunter_zy",
   "source": "solution.md",
   "exercise_id": "517921eb39ac410daba02fb3929b3eda",
   "keywords": "算法高阶,数论算法,素数的测试,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/11.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/11.exercises/solution.json"
index 489906f4111b6c5edab84b51a31b14ac007456aa..f9b88c6febb59ac4ea8f12e9445927002f3c91f6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/11.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/11.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_43971572",
   "source": "solution.md",
   "exercise_id": "4f48e2c5da0e4ac0ba8a9aa09f2bc7a8",
   "keywords": "数学,阶乘,算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/12.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/12.exercises/solution.json"
index 0400711093d9afea99903b812dd1b84cb29a4ddf..50c230b4371b0bf5fb43e5206d62ece76decf413 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/12.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/12.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "liuyuefeng26",
   "source": "solution.md",
   "exercise_id": "0120fa66c9424a8fb367615492018524",
   "keywords": "算法初阶,基础知识,算法基础,设计算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/13.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/13.exercises/solution.json"
index 4bc0f77e8df162ef40996b6b633f29f11c12b062..db05ddaba7f062f529ed63c7b743747ef2f72221 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/13.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/13.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "conquer2009",
   "source": "solution.md",
   "exercise_id": "de83b7d7036b49fe9c0bc8128810f14e",
   "keywords": "散列表,散列表,算法中阶,数据结构"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/15.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/15.exercises/solution.json"
index 9a83452d353e881ffbbae4f12abdfc4466cb474e..dac893f97ae3a600a912a779bfd4639a455a16e5 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/15.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/15.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "rorger_long",
   "source": "solution.md",
   "exercise_id": "f6d4bb136fef4aae992e14e46832cdcb",
   "keywords": "计算机"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/16.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/16.exercises/solution.json"
index 1921dad551f430a9c9dbdf11861c44c3d46481d4..04734528599976cc7eff83b81bc55c7a8c936265 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/16.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/16.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_14889007",
   "source": "solution.md",
   "exercise_id": "f03f64b19771450cbd73e10f1d38a4b1",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/18.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/18.exercises/solution.json"
index d1e2b2ff38f800b5c6e3526bf7a38ebc8179eb74..f6bd60b6be3d6eb7e6d50d7e590527621c544c2d 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/18.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/18.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "sinat_25701101",
   "source": "solution.md",
   "exercise_id": "3576db7f962d40d09401af1997fa4566",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/19.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/19.exercises/solution.json"
index 170fed62fc733a1e6c73c16d3ac6a91fe0aa7ba0..d2a4d5494098891608670892d750714889a6047b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/19.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/19.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "xiaokanx",
   "source": "solution.md",
   "exercise_id": "061d051da6994ef4aad7ea7053f48e4e",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/2.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/2.exercises/solution.json"
index 1e3d6a28dcbc699d12bb4665560f721b48ca8e32..33017241ff506fa773f9163645f487afe8333992 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/2.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/2.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Sakurajima",
   "source": "solution.md",
   "exercise_id": "f7328cb8610e442b869fd26020904955",
   "keywords": "数学"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/20.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/20.exercises/solution.json"
index 02ec0752a5420356d5c49d12a7c4fc03398fd2ee..8713c4e7d188eca91012b33cc3bb946e5506815a 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/20.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/20.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "gongyezhibao_",
   "source": "solution.md",
   "exercise_id": "f5e2e3b7527d490a85584780762a813f",
   "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/23.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/23.exercises/solution.json"
index 311ef4ca734ca7ba8d64443a43c7509c213dccba..3ca4d64e8fdb5bc68e3cbdfa363510555b01ea0f 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/23.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/23.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "u014805062",
   "source": "solution.md",
   "exercise_id": "1261b1dc25094bcbb3038acde60e41cb",
   "keywords": "算法初阶,基础知识,随机算法,概率分析和随机算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/24.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/24.exercises/solution.json"
index 6ac11c31b86c3c5e78b91285e1a5cbb1c76ff382..bdc527c179cc441d9cf7d4ac2a9c89d6cda5cef2 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/24.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/24.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "lm13684864703",
   "source": "solution.md",
   "exercise_id": "55656322f3944cb79f0d37a097b877bf",
   "keywords": "算法初阶,最小值和最大值,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/25.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/25.exercises/solution.json"
index db4afef12f7c8940d94b8bdb5e2f421763156034..0742dfe2d50ea9fbedebc0367908247b9a6231c8 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/25.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/25.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "cjsyou",
   "source": "solution.md",
   "exercise_id": "959f627ef9dc4756b005ec647428533d",
   "keywords": "遍历"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/26.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/26.exercises/solution.json"
index 51f85ed6a15597a7622a10018bdf2cbcb2de00c5..b99168934efff7b5064bc4f0177e61b4359dd8d9 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/26.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/26.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "shankezh",
   "source": "solution.md",
   "exercise_id": "40c109e9bf714724a757a5a423c4c529",
   "keywords": "算法高阶,计算几何学,算法问题选编,确定任意一对线段是否相交"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/28.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/28.exercises/solution.json"
index e3f60506a89fe89bdccf3409916827edea3fb53c..6132cdbe9ce5af5b486c00d9cfe9827976e6058d 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/28.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/28.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "bozi1234",
   "source": "solution.md",
   "exercise_id": "76497293532545198c02900e03da83b8",
   "keywords": "算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/3.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/3.exercises/solution.json"
index 46678a4491a55caa7777edd70696a5905aec7241..3ca32c4ccebdd253c681940c1f7d8311e9369b52 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/3.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/3.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "hello_chenchen",
   "source": "solution.md",
   "exercise_id": "4d7e67df30b441d4ab27995957d4ce62",
   "keywords": "算法初阶,基础知识,随机算法,概率分析和随机算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/4.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/4.exercises/solution.json"
index 6a21499cda83604b0e4d6d1f131c0a38c7e475b3..ae5b8d07fc3ec2b7b4813d709666b1cc4be7d420 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/4.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/4.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32741781",
   "source": "solution.md",
   "exercise_id": "17dcafe1edc8444ea6cea1bb82bbac67",
   "keywords": "算法初阶,最小值和最大值,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/5.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/5.exercises/solution.json"
index a44b89c403ae6b4b542a7f2236ccebbae7f0c2b8..b2523de8ec4987dcf1121e7bc2cd82e682b8afc4 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/5.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/5.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "aiZenobia",
   "source": "solution.md",
   "exercise_id": "90db1431b3b0440ab4b6368a5053f42d",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/6.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/6.exercises/solution.json"
index 3c295f2989c61af099a50413f800b07245d418a4..f71be0b6989d8cd8aa5018138576379a79f381a1 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/6.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/6.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "k88oo",
   "source": "solution.md",
   "exercise_id": "12524157eec6409ab1b5e93fc9141608",
   "keywords": "算法高阶,数论算法,素数的测试,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/8.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/8.exercises/solution.json"
index 7a9a890b9222d53c09e927718e1b761337215956..2a14ab40b412762503641fb872119ded4d6768cc 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/8.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/8.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "limuted",
   "source": "solution.md",
   "exercise_id": "7896b88027e34a4ea6de980d35e10418",
   "keywords": "算法初阶,基础知识,分治策略,用主方法求解递归式"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/2.java/9.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/2.java/9.exercises/solution.json"
index 98ffb2c1cad7092a3fd46795dfaac45be8416cb6..862444f4ac97a1210e976b505cb8f6909d9a3aa5 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/2.java/9.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/2.java/9.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "peter_8187",
   "source": "solution.md",
   "exercise_id": "1815b9aa7eeb4aec927a3b93ad258801",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/1.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/1.exercises/solution.json"
index 5f5639e497632daccbab2e84debb404be4154f01..6cda165e5d93f249bc6f8d0120ff35e93200befc 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/1.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/1.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45737171",
   "source": "solution.md",
   "exercise_id": "6c50862d32324cd692f96c3d58c51115",
   "keywords": "算法高阶,数论算法,素数的测试,算法问题选编"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/10.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/10.exercises/solution.json"
index 95296fa38552e77b0db3725e1e60f5c1dcdd8497..b3da8e82c5ff038c6b089a1e0e134f275d34fd65 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/10.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/10.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "y24261624",
   "source": "solution.md",
   "exercise_id": "d6b1bd5d6de4490288108c61d739ee4f",
   "keywords": "算法初阶,基础知识,函数的增长,标准记号与常用函数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/11.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/11.exercises/solution.json"
index 1795698d1aa44e3a418ba923b54f51b4cf946402..cb9a6f5f6eaa3ecf6be74e4d754873193f590083 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/11.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/11.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_44687324",
   "source": "solution.md",
   "exercise_id": "ba09366f2adf449c8dbb2f90b7033d1b",
   "keywords": "算法初阶,基础知识,随机算法,概率分析和随机算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/12.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/12.exercises/solution.json"
index 5bf528149d8db31dcd0ca3deb66cd202d0e35a95..fb05832c7378969467dcef7a403935dadd3dd605 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/12.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/12.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "xlqlin",
   "source": "solution.md",
   "exercise_id": "e87e276f38b048e8889e2fe7fe79b084",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/13.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/13.exercises/solution.json"
index 57bd5ed71a31abf157a3050c790d288001f16e87..898bb1a659dac4cc897e5a52dce8163bdeb140c2 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/13.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/13.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "carollulala",
   "source": "solution.md",
   "exercise_id": "3a3ccc34f57f4f07892bdf339e218f48",
   "keywords": "数学,奇偶数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/14.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/14.exercises/solution.json"
index 664b5f1a16fc62cd06b74667b0898db5b359f3c5..48b204c697223903ae4767a8d326c53f56baa350 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/14.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/14.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "hjzmc_1",
   "source": "solution.md",
   "exercise_id": "3da60a14561e42a0abd5e52778d30ec3",
   "keywords": "图算法,算法高阶,图的表示,基本的图算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/15.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/15.exercises/solution.json"
index 44dc8f19c187f2c35ca7e3a89ae545ddf698e2ed..acb6bf8dd36eea6e6fb0678e39f5403492ab8f47 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/15.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/15.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_30937093",
   "source": "solution.md",
   "exercise_id": "17f01393a3a241609477ad9b49eae5d7",
   "keywords": "算法初阶,基础知识,随机算法,概率分析和随机算法"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/16.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/16.exercises/solution.json"
index e3c7ff5d365fb62331dee372a955bc3954e4c112..b6448f939a5c5b404756c4794869416f9d5290a2 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/16.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/16.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "sinat_25884075",
   "source": "solution.md",
   "exercise_id": "f9b2a164ce2a4d7f8820a5d690b69389",
   "keywords": "散列表,散列表,算法中阶,数据结构"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/17.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/17.exercises/solution.json"
index 3de4c7eed5de00969f062f45f806cdd998f7e5b2..6ec9f0bf61bc7c957e0250d1fc27a790e8c97348 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/17.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/17.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45797598",
   "source": "solution.md",
   "exercise_id": "1cd4d9de21f34c9e921c06dc12d6fa1e",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/18.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/18.exercises/solution.json"
index 1b1d5bae8c91b97736a6cdc0f0bd2fdac970729f..d02b50124b4b07c10084b91ac7bb1a0298ecf13b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/18.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/18.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "EricLao",
   "source": "solution.md",
   "exercise_id": "efb125b11d0d4507b438f6441c32718a",
   "keywords": "排序"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/19.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/19.exercises/solution.json"
index 0454e0df72e93cd040dd49e48320c7b7e6f076f9..e502a6072ace08a8d8cb7577ce3595e28e1beef7 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/19.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/19.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45635763",
   "source": "solution.md",
   "exercise_id": "03803ff6da3b419e8e9b650e8635444a",
   "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/2.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/2.exercises/solution.json"
index 100bb87d336bb18bb9331a6a04acf77ea482896e..d6340891616fa547fd0410eb44280f9c59b35c33 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/2.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/2.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45098891",
   "source": "solution.md",
   "exercise_id": "92020885fd7041279222c4dfd3ac8a17",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/21.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/21.exercises/solution.json"
index 384217ac942837959c2496ee6de653fb59a82c90..ecea278caba6ba3f1b01285dd5ebc3464af5cade 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/21.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/21.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "huang811031",
   "source": "solution.md",
   "exercise_id": "0a8280c70cfd4d1da288432aa3ef5f8e",
   "keywords": "散列表,散列表,算法中阶,数据结构"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/22.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/22.exercises/solution.json"
index 4b274aefeee53fdf387da23c0df1026e9fcd6220..dbe24b8ac78df430c79bf8a55e4e0923b0543267 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/22.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/22.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45813254",
   "source": "solution.md",
   "exercise_id": "3409457ad91d4b4e96d77dfef1cc52cc",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/23.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/23.exercises/solution.json"
index 39b22277e8ad6b84a50776acb87e369bfe1c38dc..47e2bb2dd1ee3c59b7293cbbc5ac480ae1da99da 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/23.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/23.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "oHongSePuGongYing1",
   "source": "solution.md",
   "exercise_id": "5a97ea92895d4fdda13359eeae09f284",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/24.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/24.exercises/solution.json"
index ca19e372d91c0d3de8482d42149bdb848d269c8c..88ebf8c4342558ab946c9c8e5f280c3bf2c80c95 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/24.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/24.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "m0_45823404",
   "source": "solution.md",
   "exercise_id": "53be93ad31624900a621d8a1980e3d15",
   "keywords": "猜大小"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/25.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/25.exercises/solution.json"
index 350f2fbc834536c2e410977a1fe2f67307506345..985a45cde560e041dfd0f7f74eda89ae5c9c5305 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/25.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/25.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "WO520AI",
   "source": "solution.md",
   "exercise_id": "380add44a3b646f9802a5e44575f5f9c",
   "keywords": "散列表,算法中阶,数据结构,散列函数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/26.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/26.exercises/solution.json"
index 790cd3714aaeddbef968fd3d75f38fe4c87ff47f..1ad3687af599d08f5e0459c706b0e46d17eeabb6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/26.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/26.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "guokenime",
   "source": "solution.md",
   "exercise_id": "f735d40d184d4dc0a216d0365dca8e0e",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/27.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/27.exercises/solution.json"
index f4cf6b63f69ac3655415ca6042bcca95a450a84b..b6a28e500ba759158fbc9204ff660633c06f587e 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/27.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/27.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "asd807832658",
   "source": "solution.md",
   "exercise_id": "a364b4973bd2480ba3dce0cde34f92cf",
   "keywords": "散列表,散列表,算法中阶,数据结构"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/28.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/28.exercises/solution.json"
index 2224a4ac3789800e63cbf3204dd8208bc0a6fbed..02ca4686ea0c67610a49709ca686cc31ced47222 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/28.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/28.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Light_1009",
   "source": "solution.md",
   "exercise_id": "30270280c9354fe1b8a8eb60e6da45d0",
   "keywords": "算法中阶,贪心算法,活动选择问题,高级设计和分析技术"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/3.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/3.exercises/solution.json"
index 31b25d3fe04a5463459f23aa29de533a55273fa4..5231aa12ccbc03d4e4de2b739b94f0b438ffd409 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/3.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/3.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "lihao1987425",
   "source": "solution.md",
   "exercise_id": "ceb695b85bf048399856af31d1c47871",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/30.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/30.exercises/solution.json"
index aaa2262903982a15185b1b29046140141a62d5d3..58c8077c6764787e7806dbd5f2829a2183b43515 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/30.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/30.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "5bac8a7cc669449f8c4f98f86335f84e",
   "keywords": "字符串"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/31.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/31.exercises/solution.json"
index 070077e96220ac99e05efcad7d45db311ff2333e..6c4a13a70a03f133bba14e0646d70739c64eff32 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/31.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/31.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2a8059789b8a4bb6b8ddcff5c8a39778",
   "keywords": "链表"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/33.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/33.exercises/solution.json"
index c36fea98d3f808fe4dba6297f35ff0a8f552d9de..3b75f88532c8aef1fc20eec2d6c3e50c9a6c1e41 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/33.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/33.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "f63bd834c1f340dba184219bdb307d37",
   "keywords": "树,深度优先搜索,广度优先搜索,二叉树"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/35.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/35.exercises/solution.json"
index 3a58d97661c897820be5366d2fe6fa2e671d1056..554901ab2ad07daf49b463b99c37b825fe7aa757 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/35.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/35.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "af25ce9a4f4c425b8c900b3345aef661",
   "keywords": "数组,双指针"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/36.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/36.exercises/solution.json"
index 0e206a50963898e1f27cdb172823a012c91e93ba..d68169d55b699ad880e1a2a69e18da599c5ae1ad 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/36.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/36.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "b86b5967c10d40aa825dc4a9c1624d9c",
   "keywords": "位运算,数学,字符串,模拟"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/37.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/37.exercises/solution.json"
index 7b7d9a9128b8b97f92f2ee12cb13f29b3b88292f..654a580301fbc5b9dd33dd93016ce17363c17e83 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/37.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/37.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1f488d8bd1d2415e8e24ede9f742f962",
   "keywords": "栈,树,深度优先搜索,二叉树"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/38.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/38.exercises/solution.json"
index e5390c336f11a3e2842714a9fb9e07444cda5a57..981b0c6e28c3954cc379595ba8b3d9027a351302 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/38.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/38.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "0a12ae6577704d18b37db6956fe16aa8",
   "keywords": "记忆化搜索,数学,动态规划"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/4.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/4.exercises/solution.json"
index faa8ba273b7771f7ce3557e6381face977de556e..d5dbda70a19906038487b033b8ed12f9a8eb91a1 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/4.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/4.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "kucodes",
   "source": "solution.md",
   "exercise_id": "05afe850f47545f0a825d1df5315fff5",
   "keywords": "散列表,散列表,算法中阶,数据结构"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/40.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/40.exercises/solution.json"
index 46335199cf113729caf677cc6a6a7c530c9e9e6a..7f67bf3933e0f11adc69d708f35b6cf5fd1e7fe8 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/40.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/40.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "7ba27bc1a0b144f992860e885820382e",
   "keywords": "数组,数学"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/41.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/41.exercises/solution.json"
index 476b1ade73a393fd778e11557e60d4262d03eb93..814e34f833cd588fb346b5633cfe5a2028c96d9b 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/41.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/41.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "02dce007329c4e84a7762ff88219341f",
   "keywords": "数组,双指针"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/43.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/43.exercises/solution.json"
index 14c65549bbe7468faccfd88805b81f8c62dcaa1e..75a4d53f104bf25af5f11c988a0b2b029d7d1c67 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/43.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/43.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "a0d58370128f47f09f23c7af3c83d23d",
   "keywords": "数组,分治,动态规划"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/44.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/44.exercises/solution.json"
index 7fabcd484a02b3bb416a388469502578302069c9..2d2f5bed7177b5047926a0a9b658b980e747b4c3 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/44.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/44.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "30e3315d78704fd089eb9bccc0680b27",
   "keywords": "数学,二分查找"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/45.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/45.exercises/solution.json"
index 4ee81831ff40048ea8d3a96e34f81daadc8e627e..0bedd50641d325e41566f70f13738f2ead461782 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/45.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/45.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "6ac5ec62fe274644980c8fbc4bcb5612",
   "keywords": "数组,双指针,排序"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/46.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/46.exercises/solution.json"
index 03fb1f15a114352ec2d41e2ff1b2126d9338528b..b08681da655b62efce62e9c536fd076da2b0949c 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/46.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/46.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "63f84e83edcc43819d0650cd2fc897d9",
   "keywords": "数组,二分查找"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/5.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/5.exercises/solution.json"
index b853fffd7bb69964f9e465163889e9c7fd9fbdb9..7b5009a59bab88e0599ad9d66692913e16f0b8e1 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/5.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/5.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qianjyjava",
   "source": "solution.md",
   "exercise_id": "5ff96998f4e641eaa92a22aff18f151d",
   "keywords": "算法初阶,基础知识,分治策略,最大子数组问题"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/6.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/6.exercises/solution.json"
index 1c12a7c0027820ed52670bddfbac6e0cd991a7fc..9fea842d6ac80749cc6495e2609dbace44209a31 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/6.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/6.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45554739",
   "source": "solution.md",
   "exercise_id": "0a3ddcde88eb4f6181853a678ebf45ea",
   "keywords": "算法初阶,基础知识,函数的增长,标准记号与常用函数"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/7.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/7.exercises/solution.json"
index 211fa06d6584b12c1621843677f018252f2f65c9..8341176ec422755d55e4b65066624db7377b6f46 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/7.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/7.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "chenalens",
   "source": "solution.md",
   "exercise_id": "eb2de64e11fb45be92fbe9382ff09710",
   "keywords": "算法初阶,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/8.exercises/solution.json" "b/data/1.dailycode\345\210\235\351\230\266/3.python/8.exercises/solution.json"
index 97f8c00c933e2f88e481ae1737023463eec29352..19665e90eac937eceb6656c6581482171945d4e6 100644
--- "a/data/1.dailycode\345\210\235\351\230\266/3.python/8.exercises/solution.json"
+++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/8.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_27976405",
   "source": "solution.md",
   "exercise_id": "9bcfaba804d84dbf9ee53401b14c70fb",
   "keywords": "算法初阶,基础知识,算法基础,设计算法,分析分治算法"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/1.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/1.exercises/solution.json"
index 191043c977d2e08df6fcf8e506d03ea0461be565..4ab9cf394aa95ae913991ae1c7934bad5100c146 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/1.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/1.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "u010765996",
   "source": "solution.md",
   "exercise_id": "fafdfa2e8e56437ea642dfb3d21e95b4",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/10.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/10.exercises/solution.json"
index ba31b4f0ca8df797006467e8b68e4fc67be54324..a8b675864a2764efe5d8d269e1985ff92b093977 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/10.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/10.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_43874743",
   "source": "solution.md",
   "exercise_id": "5265ade74d9c43c98e2a88eb972630b6",
   "keywords": "算法初阶,基础知识,分治策略,证明主定理,对b的幂证明主定理"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/11.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/11.exercises/solution.json"
index 4bbcac5a9aa3b8e73fb16afd5f28e34ad1571755..55d45967b4c2ed86af2e8f452297132423aa880e 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/11.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/11.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45814772",
   "source": "solution.md",
   "exercise_id": "bc05079a8d144ad184588ed17949f14d",
   "keywords": "算法高阶,高级数据结构,不相交集合森林,用于不相交集合的数据结构"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/12.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/12.exercises/solution.json"
index 3a338232a43b3c6384e11b1284b734006d639787..89e25a4310b4aacc2118eb0926cc6188e6e55e14 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/12.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/12.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qw13660356826",
   "source": "solution.md",
   "exercise_id": "28493fd954234d6bb0acc46411c635a3",
   "keywords": "算法初阶,基础知识,随机算法,概率分析和随机算法"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/13.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/13.exercises/solution.json"
index 1bd9a208d69cee325d1bc689d0cfb9b6648c3e96..8ccc496c903704e5d49b10b012db50837fffe672 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/13.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/13.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "xiamiye",
   "source": "solution.md",
   "exercise_id": "69471807c64a48d4a531c75fc5a474ef",
   "keywords": "约分,数学运算"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/14.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/14.exercises/solution.json"
index ccd45218cdce18b61a88161c7a42c620188e0568..5c0a129cda56fad971096f1542d6e7a65ed40d31 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/14.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/14.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "oYangShiZi",
   "source": "solution.md",
   "exercise_id": "551715871e814d718500f8cc0bb3ade3",
   "keywords": "算法,排序"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/15.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/15.exercises/solution.json"
index d34ad526b6dc251741261ec480c2be93c1c46c6f..77bc0f9362d3432d072a8c73911ba8b768873ab7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/15.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/15.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_29404001",
   "source": "solution.md",
   "exercise_id": "de64fd3104cf4997b51ff9481e68741e",
   "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/16.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/16.exercises/solution.json"
index 762e2a3b771167f81a5e2d88199d4e058b5b1b72..c49eca0c83cf7320c9dd3c93f263c49a87258271 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/16.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/16.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_32591279",
   "source": "solution.md",
   "exercise_id": "08eb0ca1decd4be9b59ef5822951ccdf",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/17.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/17.exercises/solution.json"
index 7f264f2bfd22c93e1ac4d0700a82bcda93b68d3c..35bbc7eb09689951f5177cffb40ae5a6a2f8eab2 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/17.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/17.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45808110",
   "source": "solution.md",
   "exercise_id": "13364b60933343cf82bdee276b57df98",
   "keywords": "动态表,表扩张,算法中阶,摊还分析,高级设计和分析技术"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/18.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/18.exercises/solution.json"
index 1251f4212a9e64a711d116cef526450ffc8186ab..5e792e92fa3b20f2e6077618400604304f6db083 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/18.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/18.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "ohpatch",
   "source": "solution.md",
   "exercise_id": "c9741339e3e148d8bb36f4dedc4ee64e",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/19.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/19.exercises/solution.json"
index b87bd7f1b5d43950ed416ced1e6fb38820d8e3df..44cd88ee35499a0b300edef6cc2a685af6ce5608 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/19.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/19.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "ccqz",
   "source": "solution.md",
   "exercise_id": "658692f122d849e5820bbfcafe79cea4",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/2.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/2.exercises/solution.json"
index 5513dd4f8866c0f150ee0987af9b6680c343abd6..0f1b3f9c2f80f45113d1e84d203f02b532860b53 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/2.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/2.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_31328259",
   "source": "solution.md",
   "exercise_id": "6fe0402a3ed24db89b062d4facb32c96",
   "keywords": "算法初阶,快速排序,快速排序的描述,排序和顺序统计量"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/20.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/20.exercises/solution.json"
index 642462e0d834d8eb4015352d8bd3a62b3c49cacc..a5f9a0f746552f8faeabdeeffd19acccb16a97a0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/20.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/20.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "lumh163",
   "source": "solution.md",
   "exercise_id": "adaafd274929424bbc919eeecf16104f",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/21.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/21.exercises/solution.json"
index 17d256796d6ce3525dc6588583b4722f3315fc6d..1bde4e51949f9b9e0c583bdf87cf20ebe62c62cc 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/21.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/21.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq51406270",
   "source": "solution.md",
   "exercise_id": "15f66b0e55ac4032adb5988691b42b98",
   "keywords": "算法高阶,数论算法,元素的幂,算法问题选编"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/22.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/22.exercises/solution.json"
index 4a187a56bb47bbd792fdb107d0848c526c3a683e..76c2d61672596e967ac6313f0694560bb1785dee 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/22.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/22.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32564775",
   "source": "solution.md",
   "exercise_id": "4b667dd8e9684cf0b6803199b4dea008",
   "keywords": "数学运算,图形输出"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/23.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/23.exercises/solution.json"
index f5d9cf4bc6f97cbc6553f85118696a3b5456e86f..00b00772346491b25ddfc3d8473c06f0f8fc73a5 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/23.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/23.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_41157240",
   "source": "solution.md",
   "exercise_id": "9f1a313a18104a15a16993dc67f8da0d",
   "keywords": "算法高阶,数论算法,元素的幂,算法问题选编"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/24.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/24.exercises/solution.json"
index 847df0ab915828e55a4053033ad899db0366bc99..f8463ca52ae1780be76a819ad7ae0b6f898948e9 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/24.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/24.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_44739138",
   "source": "solution.md",
   "exercise_id": "d75a74cf74a64aaba143a845e5fa74b8",
   "keywords": "算法初阶,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/25.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/25.exercises/solution.json"
index c9926a3e06d069da3024d0ac63482a89f545f337..9daf15a84c629cce1aa0fe07fff79a9c8fa05a16 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/25.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/25.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_31270229",
   "source": "solution.md",
   "exercise_id": "7b4639bc58ec40cba62d0e7025d4600d",
   "keywords": "算法高阶,数论算法,素数的测试,算法问题选编"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/26.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/26.exercises/solution.json"
index 88b66ca9f1f42449f6442f54a164382bbca16aa3..482cd7b0b24e878e3ecf92db08fb9c3ec341618f 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/26.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/26.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "Kall00",
   "source": "solution.md",
   "exercise_id": "535ec33e9b9f441e9e03a59a68cc9b36",
   "keywords": "算法初阶,基础知识,函数的增长,标准记号与常用函数"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/27.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/27.exercises/solution.json"
index df818b44e1c7e927bead370cebdcd547184cb18a..e748e64975d8bfb83abc188278ef39680f60cfc0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/27.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/27.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_31182221",
   "source": "solution.md",
   "exercise_id": "ad89713d26b348c6ab72d1b227cb5a8b",
   "keywords": "算法初阶,快速排序,快速排序的描述,排序和顺序统计量"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/28.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/28.exercises/solution.json"
index 837f662988f639e38e76d82f48750f72777c86e2..1819e75b6ec6cfed344cceb00abc75be3d72ba8f 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/28.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/28.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32543603",
   "source": "solution.md",
   "exercise_id": "9f7b44bc0ca244a5b5d910902921af69",
   "keywords": "算法高阶,NP完全性,算法问题选编,多项式时间的验证"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.json"
index 11f8119ab5e0c877318ed065ed023efd21aa0c9d..b65f035af9cdd73d22e0cdf1ac1ee37f06526b54 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "c360ad96980d4503a5e1bc0b1865971b",
   "keywords": "树,深度优先搜索,二叉搜索树,二叉树"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/3.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/3.exercises/solution.json"
index f25865daf3cb65868f9b4db7d985cc1410d4c254..f6aacfcc25b9620ef6b61cf01b39b44fa352aee5 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/3.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/3.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32805831",
   "source": "solution.md",
   "exercise_id": "5cb9e1d5145d47fab87b6f8e0c239c15",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/30.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/30.exercises/solution.json"
index f9db58be4cc775bf393fdd7516d8b8ec204eeb56..b63e6eafbf6523deb814ccb7109661705224f505 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/30.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/30.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "600f400ce85d47949ee960dbfe2501ac",
   "keywords": "位运算,数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.json"
index ff9a4564df673b4402e9138b87fe03c9935f132c..82b87a8e3030cb8182c0580a424741a5b95c8428 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "31bb7bc11f944fe7b47650cfcbb7376b",
   "keywords": "数学,动态规划,组合数学"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.json"
index 25ad415845a99200f67808a221a794fa3e5d8840..25a653de7f7e4ad89a94e5376fbfd0b51d96ab0e 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "93f4a20c10584a4aa9a52d08e6f1df50",
   "keywords": "树,二叉搜索树,动态规划,回溯,二叉树"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.json"
index 99f16998ac4b2b296117ee82f8bde039281cd0cf..560cb2d1da64b898d99c977f8cc38726dc19831a 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "b83b2c495c46406e8776d85e98306307",
   "keywords": "树,二叉搜索树,数学,动态规划,二叉树"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/36.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/36.exercises/solution.json"
index a94f78481895993e79885f7779d69e6305987f0f..f0e44ee17b1fa92a57e5e40527e4b3f2dfdbf13f 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/36.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/36.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "166b639fcb7c4523896615e6ea790a5b",
   "keywords": "数组"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.json"
index b13240776a48ee67e881ec51c82a787e17cd4328..d63d19be6d03bcb6f9fad83603dd5c70dd069128 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "c6f46d0c1b2f482fa29cf08bd6cf0215",
   "keywords": "字符串"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.json"
index 546f3201eba87e84fbba7a2a5fe147ddae3d4625..2fc91eaf4fb4ac51df5634fd01719e4ae7131fad 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1307e303d169493b8d5e46cd3133404d",
   "keywords": "链表,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/4.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/4.exercises/solution.json"
index 4fcac678b994021b5f2fecd04346d4200f27ff07..046e8751a0aa041db930450dc9ff759b4d55dbe4 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/4.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/4.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_42826033",
   "source": "solution.md",
   "exercise_id": "16bf643a88c848a1835904baa99cce89",
   "keywords": "算法高阶,数论算法,元素的幂,算法问题选编"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/40.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/40.exercises/solution.json"
index f0f8cd0f9c0fbbe1228464166db5981b8931d1c5..a686876d7ea006cd365dded83893a7241c2d5e78 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/40.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/40.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "ee4e57be8bf44e5aa1032d69b3fe55b2",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.json"
index 6bafda4d7a35dc0c57dfa46bc3a360dc5492ef14..cc6827afd0e9da47555e7c50f58fdb76ef7275f0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2ccf0ab29b484a67a42e6aa7b5387498",
   "keywords": "数组,数学,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/44.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/44.exercises/solution.json"
index cf86292c8cb5993156480cde0311a1807a29def0..4d100db0ceddcc06e913a0c400296c96a0bb6a5e 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/44.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/44.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "cc1b8932f88e4cc49bedde7f1da4b00a",
   "keywords": "字符串,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/45.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/45.exercises/solution.json"
index f93e96c1f863754c6f46fa7274b4fb8706c42dec..fb5114423df8469bc7bd1e4b66aad18d04fdde6b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/45.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/45.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "458f6358d7514fb6bcdfd7f9238c3d7a",
   "keywords": "位运算,数学,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/46.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/46.exercises/solution.json"
index 474677ad5792945283fe4a76eff4e79cb9ed8c0c..d3db21ef6cc2dd64de42bf9c6a3300fbe7ed04af 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/46.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/46.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "7a6f6ca9a3c04afca7db080c109ad995",
   "keywords": "数组,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/47.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/47.exercises/solution.json"
index 7a0f7f096a6d8c6646419e02d61be9e614f41461..bb067cd3b3deb3197e514f20b68a4db4c2a15233 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/47.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/47.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "79def0a76b1546459f90832b72be77f8",
   "keywords": "位运算,数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/48.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/48.exercises/solution.json"
index b098b003db6dcb143517c34ebb1391f918ffcab4..ab45eec0be92571c90b135100b1f56d658c061a1 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/48.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/48.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "4f4a298d07b14920a0c442fae663c09c",
   "keywords": "栈,字符串"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/5.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/5.exercises/solution.json"
index b4327c9c83594a819aac5f5f9b803f16491b99fb..ee84cec768ab2b2ae36ca21a5b5200fbbbe9cf09 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/5.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/5.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_20692663",
   "source": "solution.md",
   "exercise_id": "4583002df4554ecd90bef873754b79e1",
   "keywords": "算法初阶,最小值和最大值,排序和顺序统计量,中位数和顺序统计量"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.json"
index 1816304233aeb96889bb884274cda90b7c81ba5a..316cc37f35a7e213a3ed6230083aec93e81c4683 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "227a6d828db449378c393687dc7973b6",
   "keywords": "链表,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/52.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/52.exercises/solution.json"
index 5255b7aa3760e15080f2cf563d7a4565125f8f35..16ef2aee06b516282ee365349a7ecd73ac81800e 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/52.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/52.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "bef2ebd0a073475684a90db3e02ab3bd",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/54.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/54.exercises/solution.json"
index 41c27bb4fd6d374b94e9870d463818fa810defbc..9677ad2ba3d69a245f35afdd86546e9a0613e3da 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/54.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/54.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "d9fd29e18762417cbf523fbf4fb0aa5b",
   "keywords": "字符串,动态规划"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/55.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/55.exercises/solution.json"
index 31d59b3a05cf786936034ffa9b0e71a6943687ec..15e955576f906d9016d1d658bb6da3f742262c51 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/55.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/55.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "7d7aea05317f4fa29074594e49a0cccc",
   "keywords": "位运算,数学"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.json"
index ba1a3da973d7fc547cfc09cc2ffa14525b7175fa..db1e1a7503db941c8bd161431ff832649a4ac0b5 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "0f48bea424f74cc99e0a9923a379de7b",
   "keywords": "数组,矩阵,模拟"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/57.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/57.exercises/solution.json"
index bf1d467b97d3261087705f30b243986e276cd5f3..c15d4d607d0c355dc30baba154813c2a1af3dcb7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/57.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/57.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "e9241eeeec6b4b34895f4660e3c63ec1",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/58.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/58.exercises/solution.json"
index 6f15b2293d6533e9a25f0325cb27ccf55fc0f6ce..2f82c0e42f5edf8f0b94c9b5529c98ded96f31da 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/58.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/58.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "a3020da0581c42f6b867cc64c1144d75",
   "keywords": "数组,二分查找"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.json"
index ad2e8e663b55d0f739e764b743451e8b330e536c..8e11f51306fa588246a4c38ba473b057a77ee6eb 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "c3bad4cbaf914741b47c8e84ba7c40a7",
   "keywords": "数组,二分查找,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/6.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/6.exercises/solution.json"
index 71314183edc72d2ee1dce66bd1e334698d69d10e..8cb2ed050e814b1c80cf8232ceb6e3258c99b8ae 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/6.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/6.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "linjun1735",
   "source": "solution.md",
   "exercise_id": "b167d2a52cdb4eaa8594b1ae719c5a84",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/60.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/60.exercises/solution.json"
index 63b92798b90f854e6b9c8cc2891ccd978e791f48..13805afca778cb15cccbd2a4f2a33a8397f5a3a0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/60.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/60.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "a3f9980b1e51486dbe5eb11c49d13295",
   "keywords": "递归,数学"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/61.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/61.exercises/solution.json"
index 0340193cb809a5dea1b646a539daecdb923eba7f..7b6fea5d94fe6bbb259e8cd3959ef1ea804012d4 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/61.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/61.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "6cf8646d7f0540569d46a883e4795dfa",
   "keywords": "哈希表,字符串,排序"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.json"
index 0cc0f6676844144688b4f6633fc0609ff5381a47..6005ab3288344c28f936d90c5ae7c15115acd653 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "a5cbb63775bb4b6d80ebcb4b2dc0ca66",
   "keywords": "数组,哈希表,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/63.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/63.exercises/solution.json"
index af8eb3373f981df6d24ed7d108169892e4836687..828fddf45bcbfe7e41f1658d319edfb588636ff3 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/63.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/63.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "b79586225ee645c59544bd27132cb5dc",
   "keywords": "数组,二分查找"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/64.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/64.exercises/solution.json"
index 8a886816a712d02b7d3e8e59daab62e5fb1f199d..da82bb273acefdf5cd7887f2998eec600f5105ec 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/64.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/64.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "837128c8eb2c481ba2cb3ca390a5df10",
   "keywords": "贪心,数组,动态规划"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.json"
index 3a8260285ac4839137f347c0b1c7c5199a73501a..cb49a5d79fe4e419c13bf326597cb9e7e1f4652d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "04e3a587f60c4cc5aeb21d77711430f7",
   "keywords": "链表"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.json"
index 433ddb63e16917cb8a41ee82e76cb3c14a68f952..d177b2f28deebf98476adb6fe88b8e2100725a86 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "0e7ad87cf9d74d31b2f292832b782fe9",
   "keywords": "数组,动态规划,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/68.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/68.exercises/solution.json"
index 96462cf97ba61d07591cb5835d5f0372cc932c6d..9c50618bc49a9fdd63aec6eeec38efdfc50c22f9 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/68.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/68.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "28697aa8d9b94ea4877b314637b97fbe",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/7.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/7.exercises/solution.json"
index 5c5d2c85b70caaaa3169fdef565b77e8120ffbff..e0f323d97c8cf61cf7f3351c083f03f61fe3cf47 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/7.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/7.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "chqing21",
   "source": "solution.md",
   "exercise_id": "83ff4228dbc34fa3b8d9ebad0abda73b",
   "keywords": "算法初阶,基础知识,分治策略,证明主定理,对b的幂证明主定理"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/70.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/70.exercises/solution.json"
index e1608b7cf1e7dfeef8fb0d9f36c4af5dfb3ce972..5b26af65c26c530a824345872a7b309461180ed1 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/70.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/70.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1472af7b2fbd488290d393506127b757",
   "keywords": "数组,二分查找"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/71.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/71.exercises/solution.json"
index 50b90220325a413feed23e678432ce78298cb762..0a5df1943126088bb427bbafa604804604181e1d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/71.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/71.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "31c007d8e92d45df854f76b2da1cb73a",
   "keywords": "数组,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.json"
index 0a9ddf7a19258b5cb8b3df8dfed1f436cc40ecfe..9248ff620ea1dfa71e92f3459970444cb6a203c5 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "7dbac7048db7411aa3b443a245a2b4b6",
   "keywords": "字符串,动态规划"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/73.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/73.exercises/solution.json"
index c617e0c15d402689d21ef97dc54e67c50ccfb9b0..0ee86915084d270b80154a9d6df385ef0ef35971 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/73.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/73.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "d6e56bd60df4435b9f47c04b4374b804",
   "keywords": "数组,排序"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/75.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/75.exercises/solution.json"
index 800a520403174deeec673b8c1a0b350a69c709d6..d7581bf471036c4cff623cab8ecd84d2736f2a3f 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/75.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/75.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "81767d7398f748a8a652eaec95975385",
   "keywords": "数学,字符串,模拟"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/77.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/77.exercises/solution.json"
index 5a27f8e6e02d320927b042b175cb5db632b96dc5..f92734a0ed8bc765fac9cd0ba53e57d4586a5bd3 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/77.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/77.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "6b2821c095b94e7499a60edc54515517",
   "keywords": "贪心,数组,动态规划"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.json"
index 8333b4827cf2748778f73ea96e0e18aeedc2cc18..b7148c03b4546d0517a0b38ed29ef40bbf883736 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "485511cc5a7a4c6e8fdb39cd60d07047",
   "keywords": "数组,回溯,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.json"
index 1ff1e2e6671e3f48dde71fec8789d0a4a08c5664..e969c063ceac95d4a08815af7ff765073001299d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "4655300e1df74e79ae306dd06c7c4cbe",
   "keywords": "树,深度优先搜索,二叉搜索树,二叉树"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/8.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/8.exercises/solution.json"
index 550348c48b47561463fc760fd35f95de691f9325..31606ce311dab12f7c63a4463f911d2e97124052 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/8.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/8.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "wojiaoxiaoqingting",
   "source": "solution.md",
   "exercise_id": "8e6b1f337d77412d8cbfc256ba0e5f6e",
   "keywords": "算法初阶,排序和顺序统计量,中位数和顺序统计量,期望为线性时间的选择算法"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.json"
index 1e836dbd162ff877155b7f8f6bb00c85aff5bae2..7f300c627861749383c9c4c0d0f19e2e4efe8b89 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "d880c4799a52441f9d30628b196315d0",
   "keywords": "链表,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/82.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/82.exercises/solution.json"
index 182ea3049cb66f18d2165a34a79ef049feb48691..3c47d6013f8fb92ec18779eafc8797148a15d4cd 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/82.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/82.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "3e719cb3f4dc4965869967acc997108d",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.json"
index ba78722e4a75363c48a2376955546176f7cd9d15..17cdac48f91bfcf99199ee9df9b27bbd05e1d171 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "03ce5873e9874d519a639d13cbafda4f",
   "keywords": "数组,矩阵,模拟"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.json"
index 15838125cdd9c0ce1920fe92b5b99ed75b600a29..58eb8736f4dd7cfb1d26a8e4ae4eee5aa160e08a 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "cb4c24a331b64c8c91916b1d751fa87d",
   "keywords": "递归,链表"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/85.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/85.exercises/solution.json"
index 39796e34bc8560c4dd2801f1c1e77750fbc0d66a..18b706c129801ac34825449948e171cbcb01df23 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/85.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/85.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "85a319fbe4b643e0b11939d9434f8a3e",
   "keywords": "数组,双指针,排序"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.json"
index a3d928b7b74e4af3db3eb9b096c6be814d5a6ce6..307fa2a2453e40b2fce21c703191dc060b82a595 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "49a32f00b67543ec98399a8e3266b20e",
   "keywords": "数组,动态规划,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.json"
index 560094c5577c61d665175c31ce620b660651901e..e50f07d293c9486846fc036c0a70a7265293d6aa 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "46cd4f2a4d904b3e8e261a2904f5b9e6",
   "keywords": "数组,哈希表,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/9.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/9.exercises/solution.json"
index 06db345e6907ef746c53e16d103d052a8a798c7f..8ab476d2457e2ad4efbe0215f99678a6ba4f218d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/9.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/9.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "oldbiestar",
   "source": "solution.md",
   "exercise_id": "90d989a6c03b4d1190c2a5a512d4c3bb",
   "keywords": "图算法,算法高阶,图的表示,基本的图算法"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/1.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/2.java/1.exercises/solution.json"
index 293dd02131deef3897aa9bf796d8cfdac2dc6b35..87510ef7e9b6ce566357525e2dd3da942caf80a1 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/1.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/1.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_30492837",
   "source": "solution.md",
   "exercise_id": "853c9f5792e8437ba59bafcd5804f968",
   "keywords": "算法高阶,多线程算法,算法问题选编,动态多线程基础"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/2.java/3.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/2.java/3.exercises/solution.json"
index 660ec70d3f4656c03822f929f2753c650477e755..9e767396d2ca9e50f5a367855ed80cf48f382109 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/2.java/3.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/2.java/3.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "l986493387",
   "source": "solution.md",
   "exercise_id": "441c30924add4c18b110cca521fa7736",
   "keywords": "算法高阶,数论算法,素数的测试,算法问题选编"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/1.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/1.exercises/solution.json"
index 449f6cf998a6f9bff343da1b44f26c965ed789f3..2099961893c431d5dd8954d5791f62438c8f5440 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/1.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/1.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "u012541513",
   "source": "solution.md",
   "exercise_id": "8f2b8850ce1c42439df5b706d8c39256",
   "keywords": "算法初阶,基础知识,算法基础,设计算法,分析分治算法"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/11.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/11.exercises/solution.json"
index 3b70356bc11f8c477738627ef61950f4cbce4168..4f18e3ffd69737989b291619ac6128b3682a05a3 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/11.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/11.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "3c4e98aed0c84e57a07ff32e815e3029",
   "keywords": "树,二叉搜索树,数学,动态规划,二叉树"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/12.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/12.exercises/solution.json"
index 9c1d289fe9bdca4e02e1a639fc92f3d2f0357e98..f7bf71abd1c27e98205725fed7cffc1a81362525 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/12.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/12.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "e13e25e7e45440858e26bb2effaac800",
   "keywords": "数组"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/14.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/14.exercises/solution.json"
index 745ec19fdbe900103436d2fa13da7f16da959d9a..7f233f55a2fcd622bdbc7fbb2dac5181107017df 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/14.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/14.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "cc5dccee574d40d1b46dba4b524fdca4",
   "keywords": "字符串"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/15.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/15.exercises/solution.json"
index 1bae163ca963331dbb55e9c9df962eaf6828d9fa..0aa35317b6f48e4cd0115d358bae2c59e96c27fa 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/15.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/15.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "c7708cf22e8d42dd8ca2dd501b24bc2a",
   "keywords": "链表,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/16.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/16.exercises/solution.json"
index d292154ef0bd0e27c2e7b6a7a9eb0f485f03a6df..58b08aff8797b35fea3d5ad8546718c082161ae0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/16.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/16.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "076fa5cfeb7f4adca7fc812b5a58edc5",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/18.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/18.exercises/solution.json"
index 2774990b16012e40f1725eb2f5b522ce609397f6..5d2e987eeacc963046d42f3c67e6416003a8e18e 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/18.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/18.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "c3f41a2455904f5592df1ff3aa5e3519",
   "keywords": "数组,数学,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/2.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/2.exercises/solution.json"
index d763afa23e8c4aeefa8e136e10a968324a8ad876..ee30f377058132def7e9547e2eb6abaa2eaf35cc 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/2.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/2.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_43971182",
   "source": "solution.md",
   "exercise_id": "226a3e3e1d564f45aeb6e475d269a13d",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/20.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/20.exercises/solution.json"
index 40ac5d7e36e4e4f28e4141ef2dbb9e50a55f3ea8..124d5545f448cac0820db8b03ec447ebfc17d3bf 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/20.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/20.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "9f9ae60bd464481d9f430ae229754d44",
   "keywords": "字符串,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/21.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/21.exercises/solution.json"
index 6d955debee9b16b07e26cdfef43dc3366ffe7dc8..dcd6c5c265f3d231aedeceb499307b3746e050fa 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/21.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/21.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "0337596b175e45568b2ddc0a22d1e8e3",
   "keywords": "位运算,数学,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/22.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/22.exercises/solution.json"
index fbdb14a3b6ca34e8853d4fa28755611de0da2eec..23663618f026cdab3220d0ab9eb362ecda15d8c3 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/22.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/22.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "9e9cc102f27d4b99b46a5563bff193f0",
   "keywords": "数组,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/23.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/23.exercises/solution.json"
index 175a150ccda4d4839d7066420623567c790daf65..8dbcfd94f1c084da381f64a12dad0ab82a3e2489 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/23.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/23.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2e066ff930634af69f5fbfabeb2432da",
   "keywords": "位运算,数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/24.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/24.exercises/solution.json"
index 2888078b43c632fba0bbd6a72fe425804241b19c..b509fd942d1a5a6d1c1c0e4f50928073672402d9 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/24.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/24.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "8d369d50d5824166a6dfafcf90a58892",
   "keywords": "栈,字符串"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/26.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/26.exercises/solution.json"
index 00e8f73c08d63d44f612839398d34b95b94cfd15..a66dbb1b36d78f5dc81eb653fc5fcdcac73bb093 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/26.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/26.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "4c70eba19b9e4343ac41d5eb062da79a",
   "keywords": "链表,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/28.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/28.exercises/solution.json"
index fe80fc1b83dd333d33348dca7d10e84e2d0bf080..5cef0112ada82b95c97cddc71275ead8d5706c13 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/28.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/28.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "6e91a9599b784a6887d11d64b628d446",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/3.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/3.exercises/solution.json"
index 0dd85b575caa665cecdb90a3c03c30d5056c5673..6381579aa49a59f629731ad7fe189757e55bf9b5 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/3.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/3.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45782673",
   "source": "solution.md",
   "exercise_id": "9f42a4ea1918468eb54d950bcfcb81aa",
   "keywords": "数学,算法"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/30.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/30.exercises/solution.json"
index ab6f0aa09b2be62066154dfe8430bd6b0f236ece..a4351cac1766e176720637dfe211d4b6aedc1a86 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/30.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/30.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "88def27bcaee46c4915df546be00d843",
   "keywords": "字符串,动态规划"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/31.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/31.exercises/solution.json"
index 3c99e089c58a4b18a94d8ec05889578a87d51361..139f2fc2ac22556db06a357736345bf0e9856130 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/31.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/31.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "a856468392d54174a9468867390a6497",
   "keywords": "位运算,数学"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/32.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/32.exercises/solution.json"
index 2c3a788f9f335592fca7d7c12be8515e229cc7f1..5364bdcc3dfc6b701e19642b18048415de83a3f9 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/32.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/32.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "283dc07c5cdf4aedb15f3ecfffcaa9eb",
   "keywords": "数组,矩阵,模拟"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/33.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/33.exercises/solution.json"
index 4f892d614b03a51b4382c8b614f9205f3942bdce..758c11a6499bf3b8962e7a0c655a05aeacb0dae0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/33.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/33.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "90285104c9554381b189cbea114cada2",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/34.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/34.exercises/solution.json"
index aa71473b378d407ee8b4ece8259617dfab460c74..eb90b022579b8f1de28365957e212c2db2040cab 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/34.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/34.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "621940a959c64dc58077351c662c97b4",
   "keywords": "数组,二分查找"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/35.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/35.exercises/solution.json"
index e60edc0781e66ff220e74f1d952c71f8958024bc..10c39322bb41a188e3f720aa1e799d5c362ce727 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/35.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/35.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "9e26f434eaf846cc9a66e332ab8ec58f",
   "keywords": "数组,二分查找,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/36.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/36.exercises/solution.json"
index ffd914c637c942eafaf63d661d688895a5decd30..4acb312a212e363a018243ee7f1edbd0a27c2e54 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/36.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/36.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "e81cc158a5d9484fa246307417ee9eeb",
   "keywords": "递归,数学"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/37.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/37.exercises/solution.json"
index fc64513051eefdf494830d53ee41e6294a5a8498..be7742eb6abf7a560002a60594567511b2c8ffe2 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/37.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/37.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "689d088dff924b3dba06a66fc6014101",
   "keywords": "哈希表,字符串,排序"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/38.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/38.exercises/solution.json"
index b691fc7d12224a9766dac02feb4293c6e5856e73..129793b343a5e4c8c6807378a5969917e2303c19 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/38.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/38.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "cf5287cf5a0b48f2bad71ab49b950532",
   "keywords": "数组,哈希表,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/39.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/39.exercises/solution.json"
index 9b5fa9067062fcbaa6668a4013a568dad2861508..9e5acd07d8610ad4694fd6ac609dc2bdd31bbd49 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/39.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/39.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "5c3fc04cab7e4336b1d589b82d2ddf89",
   "keywords": "数组,二分查找"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/4.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/4.exercises/solution.json"
index 2d65213dec97714b3d08f4a0a21ee1c311d87cde..011466629b24005c53da4aff99779b9455ab56e7 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/4.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/4.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "houxp666",
   "source": "solution.md",
   "exercise_id": "4077f0dced7149508a7104c84c7eb01d",
   "keywords": "散列表,散列表,算法中阶,数据结构"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/40.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/40.exercises/solution.json"
index bb18cfe472e2b5ef455a5ea9008bb12c5e04e013..2e4436212a63b4b929958bd49f633bb877ed1ddc 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/40.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/40.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "84136d3c63b047249adb53ffcfd69532",
   "keywords": "贪心,数组,动态规划"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/41.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/41.exercises/solution.json"
index 9d189db25c0564d8e385fd49e99e80ea21bf28eb..714aa7ab6e42fafcce17f43384d6e272205b328a 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/41.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/41.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "f6e4d27cc81543159b689e2dc81085c9",
   "keywords": "链表"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/42.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/42.exercises/solution.json"
index 9bfebadfdf6a3a290c12b1298b6bce7dde78f193..8e5b503737485014f4980eaa20a9595b488de317 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/42.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/42.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "62b3b65b60fc494283c75e4fdecd2221",
   "keywords": "数组,动态规划,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/44.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/44.exercises/solution.json"
index 7d7dd96262c681f6adc7c612ee2f9107f72c91e5..8f5322b92d0ab835111a9c83c74fdabd9129f852 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/44.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/44.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "73cb72426b5641b3b80c60652041a104",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/46.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/46.exercises/solution.json"
index 2b7f72e1949d37c5dd72ed900770c3cd62afcfe9..c16203f4712b0bd04eeea83371706795354c819c 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/46.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/46.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "4296c87b043a4c909a7910782aa5901c",
   "keywords": "数组,二分查找"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/47.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/47.exercises/solution.json"
index 79944b97f93ad257317a244413bdcd344c559d5a..5fc91f255432c4b56459708d0d5a44a4fc8183d0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/47.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/47.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "61473748d3584d9da80dc81685349d2f",
   "keywords": "数组,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/48.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/48.exercises/solution.json"
index 6aa29e3bc70e1034cbbd067fe47d06fe642583ad..832387963c93b91872daef3fe589b75fcc2436f8 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/48.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/48.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "ba9fc2ac3cc240ed95c9d30953f8166f",
   "keywords": "字符串,动态规划"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/49.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/49.exercises/solution.json"
index df65d9c0169a56070e8f3f8d79b06c0459f9bae0..8aa86843834417f4de818036d8549bac7f919dbb 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/49.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/49.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "4091d8bdf76f4dde9c2d6aacf65da8cd",
   "keywords": "数组,排序"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/5.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/5.exercises/solution.json"
index 46fe28119e8b2d99816fdb5253034bb152bd7d07..9e404c53ccca4dff5ef013100ffd6601ac4ac8df 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/5.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/5.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "03503e53da684a1ea3ce91190a6fa91a",
   "keywords": "树,深度优先搜索,二叉搜索树,二叉树"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/51.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/51.exercises/solution.json"
index d327bce65aa0590658c8d41fac49347b4017ccbd..f5ceaa300dedcc00f1bce14195dff7862f1fa160 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/51.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/51.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "e0fdd6ed18ff4fb1923977e49edb897e",
   "keywords": "数学,字符串,模拟"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/53.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/53.exercises/solution.json"
index 4a87451ee149e4ced28d3f248d3814a446b9dc27..4786e099cead80ec614ac422aa8d9c1b6456be49 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/53.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/53.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2a0c9ca788f9488d8bd946dc1a1e3795",
   "keywords": "贪心,数组,动态规划"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/54.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/54.exercises/solution.json"
index 44865658c4d8bdd8f71813c7735b13e0f2dd25f4..09044218a7df40bcc172b491c02eaa2ed22110f0 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/54.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/54.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1f0946dd838b405484813e7849fb7325",
   "keywords": "数组,回溯,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/55.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/55.exercises/solution.json"
index 8db39efbaf0db27ff07c9279a8663c53ae2c39ec..9217d2420f540983fba8ea445387373f5e988f70 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/55.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/55.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2733703c7dd4468e999179f0bfa8be0b",
   "keywords": "树,深度优先搜索,二叉搜索树,二叉树"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/56.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/56.exercises/solution.json"
index 27c86216cc6eaa3668ed39918de6b8bc3b03ff76..0979eba5c93c62a24c7ec482ed2e3d76313a8833 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/56.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/56.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "fb80bffeb84e4af98e68afa1b7bfe0e4",
   "keywords": "链表,双指针"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/58.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/58.exercises/solution.json"
index 43551b4241eafba445b0f48d91327e1c85826f53..173f0d3bd3878711eff21d6a67599742ebf1ca46 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/58.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/58.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "e3ee6d55eb8c45bc84201e59c85c5a01",
   "keywords": "数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/59.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/59.exercises/solution.json"
index b3f823485c403fa29281b7fb7ac9b96df828be20..8e42ed57d95731a2fe11ab680b6c7b40290d3265 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/59.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/59.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "b29c970537ca4755b87b125bea842657",
   "keywords": "数组,矩阵,模拟"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/6.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/6.exercises/solution.json"
index 9188168dca7aaa6ceae9c91fa4aac40c3d0b5fd3..dfcf3d44d6b0ac9ad19114fe439e23f4cac6d36b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/6.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/6.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "391c144d469846e0be425191669a4f33",
   "keywords": "位运算,数组,回溯"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/60.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/60.exercises/solution.json"
index 53b9026f110e11b8347dc95e8fe92c3786be87f0..73ad335435efd234c7e1f26986ec73af5dc56d3a 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/60.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/60.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1adcc2813fb04141b5bc11a3f7dc88f0",
   "keywords": "递归,链表"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/61.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/61.exercises/solution.json"
index 401e07cfa991a2b6b90d29dbd675750efedfdcff..46ef4105c54a0885a13a8fb03a2f30735f5e91a6 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/61.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/61.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "02ab71216bfe43cb8027c1e3d19f26b7",
   "keywords": "数组,双指针,排序"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/62.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/62.exercises/solution.json"
index 646da65d06e547ed7ffb816904d1acbe79ae47b5..47d461a72124403739d81a82b4e61ec7b92cc47d 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/62.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/62.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "849c5599454d40f98d785961bd69d368",
   "keywords": "数组,动态规划,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/63.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/63.exercises/solution.json"
index df8934218ef76222c22c178c2acfbb7baf4dee94..f531c9db6a20143c573cfbbf39e4c06f36c5e01b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/63.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/63.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "70d2aed25c32405c8e1dd08ea627a93c",
   "keywords": "数组,哈希表,矩阵"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/7.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/7.exercises/solution.json"
index e4e81223365d2a39e91218b09db72419916dd9a2..bbd73651b56ce13dbc4c5a942dc4e1f234b8a1b3 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/7.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/7.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "31cbe7a951d24234b431f5e1985ed2ca",
   "keywords": "数学,动态规划,组合数学"
diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/9.exercises/solution.json" "b/data/2.dailycode\344\270\255\351\230\266/3.python/9.exercises/solution.json"
index cccc2a27d700dc56886b589929a295aa3f41bf6e..d7914aeadb1fbd786a1a0e8fa8095e47e5822a3b 100644
--- "a/data/2.dailycode\344\270\255\351\230\266/3.python/9.exercises/solution.json"
+++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/9.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "55102e8ea1ca4b7abadbc1595fcef085",
   "keywords": "树,二叉搜索树,动态规划,回溯,二叉树"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/1.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/1.exercises/solution.json"
index f2a8c38ba519fb7b17cdae34ae4e484275a95aa3..7349f177958a7e0372813a435a34eab1cd2f55e4 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/1.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/1.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "stm32w",
   "source": "solution.md",
   "exercise_id": "2dd2a3c6c5ca42c38a57aab0e56eb758",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/10.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/10.exercises/solution.json"
index 9028766428d5756dc9d19cc08b97a578ce1c8c79..affad7e0219e1b5deb1e847af234555140eb13c3 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/10.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/10.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_44543883",
   "source": "solution.md",
   "exercise_id": "c20537f045d74047860cc2e1d6ea15a1",
   "keywords": "算法中阶,动态规划,动态规划原理,高级设计和分析技术"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/12.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/12.exercises/solution.json"
index 55f32b0d5830d141a5efe7f8bed4c87f5a0b2d5d..2335b3c26e5013fbc40f85dfc20f1325df8e1bfd 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/12.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/12.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45794342",
   "source": "solution.md",
   "exercise_id": "204d5999cb8e4cdc81dbedfabd98fc40",
   "keywords": "算法初阶,快速排序,快速排序分析,期望运行时间,排序和顺序统计量"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/13.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/13.exercises/solution.json"
index ab271d8c7548c44e65b0fd51a5fc3e61b9003efc..4e6a8f521288d997526f1a6f1dd97c5da0cff02e 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/13.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/13.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45807915",
   "source": "solution.md",
   "exercise_id": "006fd652d9f644dd865b45b8571e9c8d",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/14.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/14.exercises/solution.json"
index 8e44366c0a6342ce1198df04682f5afd2eb2913d..caeea2f0484c17ad422637c307d7fc227d6cd8da 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/14.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/14.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_45688799",
   "source": "solution.md",
   "exercise_id": "e73bfd9784bc4eb8ae7118bac4855223",
   "keywords": "算法中阶,贪心算法,活动选择问题,高级设计和分析技术"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/15.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/15.exercises/solution.json"
index 647a4975d954186c15e783ef37d8f02c57bacccf..9dada83619dab4a3a33b7e3fa6194c0900d4cc47 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/15.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/15.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "shanli0681",
   "source": "solution.md",
   "exercise_id": "c7da4e1c24674f1592dc1527d6b5bbde",
   "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/16.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/16.exercises/solution.json"
index d134061ca73f37ed3b253ff04b5f373b0bca9031..53656f74de9707aefd2fc08cbaa3f21c2eead150 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/16.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/16.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_26805615",
   "source": "solution.md",
   "exercise_id": "40c0a8df96934a80a8122884d7bfb6a3",
   "keywords": "动态表,表扩张,算法中阶,摊还分析,高级设计和分析技术"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/17.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/17.exercises/solution.json"
index e451a7db361b5b23c59e8cc9b0cc3be3de40bec1..fbef70edf66e4da14fcd756dff06594f97319f71 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/17.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/17.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32332887",
   "source": "solution.md",
   "exercise_id": "9fc1fa0c4a6941a5af8c58f8a17072b6",
   "keywords": "图算法,算法高阶,图的表示,基本的图算法"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/18.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/18.exercises/solution.json"
index e36d07d6e488b4af34423dc4a5e6f6532dfc38f4..2902a7341b6b1b4fb870c3ade8d07b0f023bb81d 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/18.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/18.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_45811118",
   "source": "solution.md",
   "exercise_id": "ca3dd3d533904c13b864ed2bd73dbbe2",
   "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/19.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/19.exercises/solution.json"
index cc1cc50d371f55667dc6fe1f63a299698bdf7a2a..c24629681c074babae36d160d359020154c76dbd 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/19.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/19.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32702503",
   "source": "solution.md",
   "exercise_id": "ed86cdb2708f4efea6c233f131c4a005",
   "keywords": "算法初阶,基础知识,分治策略,用主方法求解递归式"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/2.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/2.exercises/solution.json"
index 88a80e17f6d2f54ebf44df1d2b5484bc64e71aef..10d3beea3298192ade9a41f58f93e1163aa09c03 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/2.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/2.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "pumpkinFive",
   "source": "solution.md",
   "exercise_id": "44e3bbff868547b6b84567fefdd5bdae",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/20.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/20.exercises/solution.json"
index 3107b35315d7052356999b36de3ce5eb3dbd96dd..b97767abef5d06fa95c0a05b62243c272c58db00 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/20.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/20.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "goddnessblesser",
   "source": "solution.md",
   "exercise_id": "9dace54a9e2647268c089328cbc0f352",
   "keywords": "B树,算法高阶,高级数据结构,B树上的基本操作"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.json"
index 3a850d4a2ebfbeed084dacd7b337d99986c9fc58..fa64df6cfea586507dadeaa25bc928a372126bf4 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "32739b19bbf04c35b20e6f1e80153124",
   "keywords": "数组,回溯,矩阵"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.json"
index e3dfbb40267e6159229786c757f5ebf52d0bbbbe..64c37a2221b3670c3337352f4896ae507c2848ba 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "b0bdaa3932ce4195b936e641c3f715fe",
   "keywords": "栈,数组,双指针,动态规划,单调栈"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.json"
index ebbe6ca9432d87576cd9c30f7bead12eb1f2be4a..e95718b40e9ce542280ad3d88c56f365fdcd8610 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "cb77daf1d0f443c092f414b87f37be04",
   "keywords": "栈,数组,单调栈"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/24.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/24.exercises/solution.json"
index 73e83d4a65d22a2242b7c36fe330f106da1e4436..753c0861daa372249520186e47de109183d7dea0 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/24.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/24.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "64b7d91db75249b2b9952b7c85e8b362",
   "keywords": "数组,哈希表"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.json"
index e1a4c516227cb8fe916038bfe63b2dc8a1ce24c8..eef4e10d98eef29b23f7fdf859a16aacfabd21a3 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "3716ea4367754f8f959faa56b01429e1",
   "keywords": "回溯"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/26.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/26.exercises/solution.json"
index 21914b8947011493b00c14f274e6452369af7a8b..0e36128d21a99dfe3167d2921135125fac0547f7 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/26.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/26.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1dfcbc2e42034d68a9cb9bca18c32f96",
   "keywords": "栈,数组,动态规划,矩阵,单调栈"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/27.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/27.exercises/solution.json"
index 51972d96266c75faf10ea8bdeb62379f8e6d8b5b..11e27a3c9e6fc5b3cdc6784b71e68c5e1ba98a49 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/27.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/27.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "9da825dca95641ec9169bf3ab57db40b",
   "keywords": "字符串,动态规划"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/28.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/28.exercises/solution.json"
index eaf905cfacc19e20fe3916b0d06357f8eee3ef26..6ac096590dd7a73cb57279754338ebdf67a75251 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/28.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/28.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "00593f4b57704a038b0429d5fe708031",
   "keywords": "字符串,模拟"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/29.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/29.exercises/solution.json"
index f03d13a6327cd55efab5190d7093d4f32e10f8cd..9e033cf6654494d8a51bf6c780503d01360c8a6a 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/29.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/29.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "328698d1b0f24616a305fb22259b2146",
   "keywords": "栈,字符串,动态规划"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/30.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/30.exercises/solution.json"
index 9376542f4a3dff23ddd900145968a1a42b68c4f6..75a7c0a4fb350e6cc572156abc644a07c7f8ef43 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/30.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/30.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "d8995d6a238f48f3b02d635f57938b2d",
   "keywords": "数组,回溯"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/31.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/31.exercises/solution.json"
index 4553017b2f5e79da6bda955fda3a3c7ce5a589c7..c561ad2f8dbd585c7647ab59c63bd877e2b4518a 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/31.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/31.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2d7f231378534510913c1295c153334a",
   "keywords": "字符串,动态规划"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/32.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/32.exercises/solution.json"
index aac05bd6a2bbda37267a39c219f0df114fac7a5f..f4a5c9785d87e1541b1d823febd098c9b1633c70 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/32.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/32.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "373908c9308b46a49d7a28894a4d6eac",
   "keywords": "递归,链表"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/33.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/33.exercises/solution.json"
index d2d306b6bfc7240b35142b1f69f0a2dbaacab2b0..36cb997bae0c627e28a85fd9833fc466c4cbfcbe 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/33.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/33.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "c74fceb8a5a54b259fdc21001910f8d8",
   "keywords": "字符串"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/34.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/34.exercises/solution.json"
index 3c77a50c43c7d44983505da350953991d01b1bc9..09961f7860ad021d2479500cb38e5228d6e2b7fb 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/34.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/34.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "89e891a205a14a10a2ee31a720f6cbbd",
   "keywords": "哈希表,字符串,滑动窗口"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/36.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/36.exercises/solution.json"
index 8509b68f4fed9ba19b80e60143a480da0104d50d..51097a0cb723ad921ec14cb72b39c8e3509d6c78 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/36.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/36.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "fef93fc39e554ebaa5e936e8fa911855",
   "keywords": "哈希表,字符串,滑动窗口"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/37.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/37.exercises/solution.json"
index e4fb41b899f934458ccc3b679c8d12ef68469cf5..b6a8e95da050459b2d03b89d0acd8dea4d2270e7 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/37.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/37.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1406e7cd7c1f44d3a9e63e9c3ff1cfe6",
   "keywords": "链表,分治,堆（优先队列）,归并排序"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/38.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/38.exercises/solution.json"
index cfb4df93f1d0aed4b1d405cadfb2e411b9388f9e..462fc02ea5c89cf3ee9e3587d80fb521754c25c5 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/38.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/38.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "0a486ed6f8c944cca2eec0db2b2ae39c",
   "keywords": "递归,数学"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/39.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/39.exercises/solution.json"
index 1142153269d5aa34f43be914182c6b6054f5f2a5..6e0fbda83f9cd99c70abb318d3371ecf34785145 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/39.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/39.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/begeekmyfriend/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "d3cb836752484324a830426c0ea6acdc",
   "keywords": "贪心,递归,字符串,动态规划"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/4.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/4.exercises/solution.json"
index 0efbeecafadf5302facfb75c65516ef6b0f6f996..5f04c706dbc9f9ce62084b1e355cd1ab156cd6ca 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/4.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/4.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "myguardian",
   "source": "solution.md",
   "exercise_id": "f26e29717a5d4a328860fd834a766956",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/5.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/5.exercises/solution.json"
index b3aa76bfe7a4a6b5860f58cba857645c4f122d50..c9c2cc63b27b6cf0ecce622f6c0a1ebb0345ff1f 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/5.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/5.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_32724981",
   "source": "solution.md",
   "exercise_id": "e7452e4cc4cf410c94611ff2756adcbd",
   "keywords": "图算法,算法高阶,图的表示,基本的图算法"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/6.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/6.exercises/solution.json"
index 3529ca65c98019e4631b42281bcd7495f8202103..d60384ca615925d1d057dae663aaf09ee06cb13d 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/6.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/6.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "weixin_36684604",
   "source": "solution.md",
   "exercise_id": "7ee5105ff58a4fb5817610530ae63aae",
   "keywords": "算法高阶,数论算法,算法问题选编,整数的因子分解"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/7.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/7.exercises/solution.json"
index 1c5fc5a30e13115fb2512fc40aeededcf4d0c33a..9f7acb5e1ed960e9237085f1161baf09b3880d68 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/7.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/7.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "u011654241",
   "source": "solution.md",
   "exercise_id": "b6dc8c02a03b46daa659052da28f1682",
   "keywords": "桶排序,算法初阶,线性时间排序,排序和顺序统计量"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/8.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/8.exercises/solution.json"
index 71088c219ecb3b62978e03d427390b377072bdaf..a1a3a187b62c754ac32c14704885f0614f13f971 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/8.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/8.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "qq_29910115",
   "source": "solution.md",
   "exercise_id": "cf33ebb0691d42fc8d960a6b825d8c3e",
   "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/1.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/1.exercises/solution.json"
index ae47e76d633eddb7ec5af93c3f43c5b9ce3bdc19..c5b235cce3233f02faa82b2701670d85e54ab0f9 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/1.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/1.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "csdn.net",
+  "author": "adsls630ef",
   "source": "solution.md",
   "exercise_id": "3eb2527a26be4b9e8b24ade9a1e4b9f6",
   "keywords": "图算法,算法高阶,图的表示,基本的图算法"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/10.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/10.exercises/solution.json"
index 3fd6b4909e6f12e89cca385295f264b1eb0a4bea..bba09ff295bb1e5a2fc92e80ad5636458a30caa4 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/10.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/10.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "2a073ce974ee4ef78251d2d44a96be6c",
   "keywords": "栈,字符串,动态规划"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.json"
index 286cc4e24961a1218215acad507f59526fbadaa5..e55d335ae53c6848832fdb243259ad65ca2e46ff 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "9827e15bed994daf9516416d5163b404",
   "keywords": "数组,回溯"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/12.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/12.exercises/solution.json"
index 6beb9cb20a1d4eb9a490585a2a926f8c97907c06..ab3955a187e7fac53ff78d4e4227c9812d18f83a 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/12.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/12.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "e729adf6a18e49d38cff091fec24807b",
   "keywords": "字符串,动态规划"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.json"
index a5991fe9dddfb36829f3a1e151cd321c983e5f57..c1228a218a259680235e5053758582e028bd96e4 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "9e3e461bc83f4444ab61d8a39acbf7ec",
   "keywords": "递归,链表"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/14.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/14.exercises/solution.json"
index df3ba405e9aad41f272302f242047cabd6126499..1507adfe5c1683353b60cb982fd8212df90fd066 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/14.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/14.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "da3abf70d2ff4066a06f956ff6deebf6",
   "keywords": "字符串"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/15.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/15.exercises/solution.json"
index 9dce67730fd03bc03cc5c8e310154a6588ac36cd..144ef044772db3bce61293435adb1ae5d44e6883 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/15.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/15.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "cb863b701dfd42ad9a13552cdf2bc6cb",
   "keywords": "哈希表,字符串,滑动窗口"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/17.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/17.exercises/solution.json"
index 0dd3b08bae85d6bbf6408c307e3d3c23b4941b7b..631239bf6d5b2a75a1aa0d9f15d98512f2dbfe7d 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/17.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/17.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "e271d921050f4418847150f08c8e5e0b",
   "keywords": "哈希表,字符串,滑动窗口"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/18.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/18.exercises/solution.json"
index 8cacc93c7c21e0ee541699ddd5fe6dbd09a8cbe1..321a743bdc668192be6f861b2c32b9f24b43440f 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/18.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/18.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "d155a0ab95f9496fa9647cf8ccf6b9a9",
   "keywords": "链表,分治,堆（优先队列）,归并排序"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/19.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/19.exercises/solution.json"
index c3bb8e85ba6a46d71bd8e593c0a6065a0d68d932..19fee3b57530b3d25279683b68aed03cb7bf61f1 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/19.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/19.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "cd3b923120a146c78e344668ed62a1ae",
   "keywords": "递归,数学"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.json"
index dd71a49f4654d863482120121a6f41e9a34a6be6..ba0ce43d26a0817abd9c9c673bd1414a4c9e7ffd 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "b3aa8cc56abb48eca255bb6a32f1708e",
   "keywords": "数组,回溯,矩阵"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/20.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/20.exercises/solution.json"
index 0f8e4fdd0368cd06350561a7c752c6bc31d2ea2c..88d0a33288c7cce092f2810de5305d04333846aa 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/20.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/20.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "8acf01ddd2b046fb8e4d8230e9342d2f",
   "keywords": "贪心,递归,字符串,动态规划"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.json"
index 9d1e492069c541f9e1c1bd22403d570868d6072b..fd11d86df195b1a6c9e83dff887516cda7dbd8c4 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "cd72e38163074274bda87cdc2c2858ad",
   "keywords": "栈,数组,双指针,动态规划,单调栈"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.json"
index 1355d56669fde7ed781269054ba21b36c7d98a50..7178b4dcff127a9a13bdef9551a2ed028ffbd04d 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1c00801cdeae4722b253ff7df4be7df4",
   "keywords": "栈,数组,单调栈"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/5.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/5.exercises/solution.json"
index 5b180aecf90bfadf83f7ff30a9f4683c1a428757..67b10037d7b1ba84f68abe4d4c21d1203798a665 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/5.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/5.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "1f4232c2b3234db68fb48ba078562f83",
   "keywords": "数组,哈希表"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.json"
index 5cf8ca670290dee000c02c04cd35ce9ab34bf53a..e328d79db0b3274c72d4895a9072a50535a1e485 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "8958654b9aff48ce871454bca4874511",
   "keywords": "回溯"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.json"
index 575a83c039d2cb82d4a09b4b9b9833b339311e9b..e4c482f7513f302043a395cf4285a1703e904efe 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "af8f002cd1d04bdaafd89c7c1f7d1eb4",
   "keywords": "栈,数组,动态规划,矩阵,单调栈"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/8.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/8.exercises/solution.json"
index 6aaac05845dbf3b06c523442d6614b62272a2b18..623d57fab41683edf72af55b28b1041b6e61845e 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/8.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/8.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "d97ccce8bb6443f9829ef7949895a1b1",
   "keywords": "字符串,动态规划"
diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/9.exercises/solution.json" "b/data/3.dailycode\351\253\230\351\230\266/3.python/9.exercises/solution.json"
index dc4b2e580b07e1c285453202a4fcd1cc42c5dcd1..145b8683709276a15190646bab24c54413653191 100644
--- "a/data/3.dailycode\351\253\230\351\230\266/3.python/9.exercises/solution.json"
+++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/9.exercises/solution.json"
@@ -1,6 +1,6 @@
 {
   "type": "code_options",
-  "author": "https://github.com/qiyuangong/leetcode",
+  "author": "csdn.net",
   "source": "solution.md",
   "exercise_id": "72a7e99c2ec146b29fe662e34da41b4a",
   "keywords": "字符串,模拟"
diff --git a/helper.py b/helper.py
index 7b3fd3ef4315bc82c03b031c790b6dcb788be90e..5c30df6e9426b11dd2006a6fe5bbb296bfee1a68 100644
--- a/helper.py
+++ b/helper.py
@@ -375,5 +375,49 @@ def write_back_topick_link():
                 # break
     # print(collections.Counter(question_titles))
 
-write_back_topick_link()
+
+def update_author_key():
+    data_dirs = ['data_backup/cpp_code_json', 'data_backup/java_code_json', 'data_backup/python_code_json', 'data_backup/leetcode']
+    question_paths = []
+    for dir in data_dirs:
+
+        files = get_files_path(dir, '.json')
+        for file in files:
+            data = load_json(file)
+            question_title = data['question_title']
+            if question_title in ['数组排序', '字符串排序', '按要求实现程序功能', '计算阶乘的和', '字符串统计']:
+                # print(question_title)
+                continue
+            else:
+                question_paths.append(file)
+
+    dir_list = ['data/1.dailycode初阶', 'data/2.dailycode中阶', 'data/3.dailycode高阶']
+    languages = ['1.cpp', '2.java', '3.python']
+    cout = 0
+    for dir in dir_list:
+        for language in languages:
+            dest_dir = os.path.join(dir, language)
+            exercises_dirs_ = os.listdir(dest_dir)
+            exercises_dirs = []
+            for tem_dir in exercises_dirs_:
+                tem_dir = os.path.join(dest_dir, tem_dir)
+                if os.path.isdir(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()
+                    title = re.findall(r'^# (.*)\n', solution_md_data)[0]
+                    cout +=1
+                    for tem_question_path in question_paths:
+                        question_data = load_json(tem_question_path)
+                        question_title = question_data['question_title']
+                        if title == question_title:
+                            solution_json_path = os.path.join(tem_dir, 'solution.json')
+                            solution_json_data = load_json(solution_json_path)
+                            solution_json_data['author'] = question_data['author']
+                            dump_json(solution_json_path, solution_json_data)
+                            print(title)
+
+
+
+update_author_key()
 # classify_leetcode()
\ No newline at end of file