diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/1.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/1.exercises/solution.md" index 307b56593a6647bd8a85412877ac049e4b8cf95a..f0eb777d3f67b9bdf7cd07c896dd702a1feba548 100644 --- "a/data/1.dailycode\345\210\235\351\230\266/3.python/1.exercises/solution.md" +++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/1.exercises/solution.md" @@ -20,7 +20,7 @@ for i in range(n,n+1): if i % 2 == 0: for k in range(2, i): if a(k) == 1 and a(i - k) == 1: - ________________ + ________________; ``` ## template diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/2.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/2.exercises/solution.md" index d348b9fcda8fc73aab594371f5131d14e6f7f55f..32e14a8be38f36d8be9b3431c68f334e5de8818b 100644 --- "a/data/1.dailycode\345\210\235\351\230\266/3.python/2.exercises/solution.md" +++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/2.exercises/solution.md" @@ -8,7 +8,7 @@ n = int(input("输入数字:")) factor = [n] num = 1 -__________________ +__________________; print(factor) m = [str(i) for i in factor] count4 = 0 diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/3.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/3.exercises/solution.md" index 6d99f537df180f64a2638cc1a977f7eb1836402f..45ff7793c0e097614ff5595247ef4a041020dff8 100644 --- "a/data/1.dailycode\345\210\235\351\230\266/3.python/3.exercises/solution.md" +++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/3.exercises/solution.md" @@ -12,7 +12,7 @@ K=0 for i in range(1,N+1): x,y=random(),random() dist =sqrt(x**2+y**2) - _____________________ + _____________________; pi=4*(K/N) print("圆周率值:{}".format(pi)) ``` diff --git "a/data/1.dailycode\345\210\235\351\230\266/3.python/4.exercises/solution.md" "b/data/1.dailycode\345\210\235\351\230\266/3.python/4.exercises/solution.md" index 336abc2c088a99344900a6b405425145cdca406f..216b0171415065f9af8dbd91824c58152a8798ff 100644 --- "a/data/1.dailycode\345\210\235\351\230\266/3.python/4.exercises/solution.md" +++ "b/data/1.dailycode\345\210\235\351\230\266/3.python/4.exercises/solution.md" @@ -41,7 +41,7 @@ x2 = x1.split(",") a = [] b = [] for i in x2: - ______________ + ______________; if a == []: print("NONE") else: diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/22.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/22.exercises/solution.md" index 93a9d829799f9d5f4ca61c24e651ab4030566d16..94bc36e64c6af1d84bc173dec619ddd839c8dcdb 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/22.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/22.exercises/solution.md" @@ -26,7 +26,7 @@ int main() { for (int j = 0; j < N - i; j++) printf(" "); - ______________________ + ______________________; printf("\n"); } return 0; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/23.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/23.exercises/solution.md" index d48747e5b866aaa4ebf45766e776f4a9884b6c87..101410a7a4a73e25b6455944272b95e9412f7df1 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/23.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/23.exercises/solution.md" @@ -29,7 +29,7 @@ int main() return 0; } int *a = (int *)malloc(sizeof(int) * n); - __________________ + __________________; scanf("%d", &m); if (m < 0 || m >= n) { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/24.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/24.exercises/solution.md" index c0504fc51b5c2fad1682ecc05f8b4c27a37a6913..c54e238693a8afd2b13195caf3c22c927b512c81 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/24.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/24.exercises/solution.md" @@ -12,7 +12,7 @@ void funShift(int m, char *p, int n) char c; for (int j = 0; j < m; j++) { - _____________________ + _____________________; } } int main() diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/25.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/25.exercises/solution.md" index 1486af4edb04e7af799a94eb4433837e30b31acd..ff2eaab8acfe1d636749fb2051457e98be0414f3 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/25.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/25.exercises/solution.md" @@ -44,7 +44,7 @@ int main() sum = 0; while (a < n) { - __________________ + __________________; if (j == i) { sum += i; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/26.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/26.exercises/solution.md" index 114ecc4c19d65aadd9c71ed3f8201151e7b03b79..2592ae61ae4b71b30a0642401ca5dbea49c15aa0 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/26.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/26.exercises/solution.md" @@ -22,7 +22,7 @@ int fun(string str) int score = 0; for (int i = 0; i < str.length(); i++) { - _____________________ + _____________________; } if (index == -1) { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/27.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/27.exercises/solution.md" index 34865282f6a39d1ab6ae6c151bc6b505f7d019ab..352932a1504e642ebd21b483c16e1c605d8a1bf7 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/27.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/27.exercises/solution.md" @@ -40,7 +40,7 @@ double sin(double x) { int i = 0; double result = 0, n = 0; - ____________________ + ____________________; return result; } double nResult(double x, double n) diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/28.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/28.exercises/solution.md" index 5e098023c6798a53956881bc36e0868ad165cb76..502e29254477268dbd116fab2f07666e2bfd3d78 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/28.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/28.exercises/solution.md" @@ -20,7 +20,7 @@ int main() } break; } - __________________ + __________________; printf("sum=%d\n", sum); return 0; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.md" index 3a3d97c532422eb60b1ebabd9e44b63cb51d9581..0a79020ca1d72c9ccd7d23ef3197e1fbd73d0fe8 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/29.exercises/solution.md" @@ -37,7 +37,7 @@ private: { return; } - _____________________ + _____________________; } }; ``` diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/30.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/30.exercises/solution.md" index fe531768a2051c0517b1a94d499731b22c7c7080..1fd7ef31492556cca7073a0b8b410c97db700825 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/30.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/30.exercises/solution.md" @@ -23,7 +23,7 @@ private: res.push_back(stack); for (int i = start; i < nums.size(); i++) { - ______________ + ______________; } } }; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.md" index 60b65e4e4b1f02a62abdf4d71710267a46a0a5ec..2aebef569dea91de1ae3b91ae90369bbef5b5719 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/31.exercises/solution.md" @@ -41,7 +41,7 @@ static int uniquePaths(int m, int n) { for (col = 1; col < m; col++) { - ______________________________ + ______________________________; } } return grids[m * n - 1]; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/32.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/32.exercises/solution.md" index 51571680d777db67978d5cc52140aa4d77ea90a2..940854b277d02afa74110d28a0e5593f30fe0f66 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/32.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/32.exercises/solution.md" @@ -29,7 +29,7 @@ public: } for ( auto& it : str[k] ) { ans.push_back( it ); - _____________________ + _____________________; ans.pop_back(); } } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.md" index 13486ea8676e8c3369f134191d868bb46d088a87..830cf2331e363bc850ffbcefe63372a4d459b833 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/33.exercises/solution.md" @@ -69,7 +69,7 @@ static struct TreeNode *dfs(int low, int high, int *count) for (i = low; i <= high; i++) { int left_cnt, right_cnt; - ________________________________ + ________________________________; if (left_cnt == 0) left_cnt = 1; if (right_cnt == 0) diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/34.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/34.exercises/solution.md" index 1af1d1bbd1912c36a082a7b5c7048ba07756d649..564a0a2ad636a02bd3ddab74e3a4dc24f67b1271 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/34.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/34.exercises/solution.md" @@ -128,7 +128,7 @@ public static int myAtoi(String str) { if (base > Integer.MAX_VALUE / 10 || (base == Integer.MAX_VALUE / 10 && str.charAt(i) - '0' > 7)) { return (sign == 1) ? Integer.MAX_VALUE : Integer.MIN_VALUE; } - ____________________ + ____________________; } return base * sign; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.md" index eade1f595032fc64d259cb1ac5f096e457df3c74..2442a1c00ad6900a75a618617127b1fc6a5cd6b5 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/35.exercises/solution.md" @@ -44,7 +44,7 @@ public: { for (int j = 0; j < i; j++) { - ___________________ + ___________________; } } return sum[n]; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/36.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/36.exercises/solution.md" index cede65c4ed8686fe1d5626f1dda0ae0acad27a41..f512d675e501ca5832ff98e51615933957840751 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/36.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/36.exercises/solution.md" @@ -56,7 +56,7 @@ int **insert(int **intervals, int intervalsSize, int *intervalsColSize, int *new if (tmp[i * 2] > results[len][1]) { len++; - ________________________ + ________________________; } else if (tmp[i * 2 + 1] > results[len][1]) { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/37.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/37.exercises/solution.md" index 0413fa46c6618b5dd307cca98cf31da646619334..55fd6f1e5ebc54f914652b3d28680e304a62e2b6 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/37.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/37.exercises/solution.md" @@ -26,7 +26,7 @@ public: { if (k > j + 1 && nums[k] == nums[k - 1]) continue; - _____________________________ + _____________________________; if (k >= l) { break; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.md" index 753e54e5a7744c499d3f2de57d94f4f93512da57..3d276ecdd022c7bc47021476388ea6ccec4e4817 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/38.exercises/solution.md" @@ -90,7 +90,7 @@ static void parse(char *input, char *output) n += count % 10; count /= 10; } - ____________________ + ____________________; *q++ = p[0]; p++; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.md" index a2216c0a5ab071f62a7734a919ae0a52fb8e4a15..415583b16df2d18be2871a162e58308c41c64257 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/39.exercises/solution.md" @@ -36,7 +36,7 @@ public: ListNode *prev = &dummy; ListNode *p = head; k = k % len; - _______________________ + _______________________; if (p != nullptr) { prev->next = tail->next; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/40.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/40.exercises/solution.md" index a8485b8b6c6ffed26e3637b21ec2c04d7299dbb4..9e863b6b81220e246ce184544b18577ee692a737 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/40.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/40.exercises/solution.md" @@ -32,7 +32,7 @@ private: for (int i = start; i <= n; i++) { stack.push_back(i); - _____________________ + _____________________; stack.pop_back(); } } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/41.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/41.exercises/solution.md" index 4305554dd24bffb567a4edcdb39516c2d321b86d..56bbeb494327f5c069dcbe85c1096c311574e406 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/41.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/41.exercises/solution.md" @@ -24,7 +24,7 @@ public: lc--; if (lc > rc) { - _________________ + _________________; } } vector generateParenthesis(int n) diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.md" index 59a4ea408d4e4d3208ca4a15aa4013ac5fa542d2..acbda44754035a451cbc9c95fd4b5809e7f106df 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/42.exercises/solution.md" @@ -19,7 +19,7 @@ public: for (int j = low; j < high; j++) { int tmp = matrix[i][j]; - _________________________ + _________________________; } } } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/43.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/43.exercises/solution.md" index b774409f38e0d47311cd7bdd54b6c747a1afd18e..96e4feb675a0cdc87aac8062b7545bb7f906b97c 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/43.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/43.exercises/solution.md" @@ -15,7 +15,7 @@ public: for (int i = 0, j = height.size() - 1; i < j;) { temp = min(height[i], height[j]) * (j - i); - ______________________ + ______________________; } return ret; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/44.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/44.exercises/solution.md" index 67803a44b126485a0006f2d4288ffc5f9b4f9d2c..2d1116886cae351ceedc49ac19ecee4cd6caa474 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/44.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/44.exercises/solution.md" @@ -38,7 +38,7 @@ static void dfs(char *s, int start, char *stack, int num, char **results, int *c for (j = 0; j < num; j++) { char *q = stack + j * WIDTH; - ______________________ + ______________________; } (*count)++; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/45.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/45.exercises/solution.md" index 74311beafad5449413e49d1063a27ed118e01c2d..a41829c3eb8e5412b4113b6b6a52b679c8c49bb8 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/45.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/45.exercises/solution.md" @@ -22,7 +22,7 @@ int *grayCode(int n, int *returnSize) } int i, count = 1 << n; int *codes = malloc(count * sizeof(int)); - _________________ + _________________; return codes; } int main(int argc, char **argv) diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/46.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/46.exercises/solution.md" index c604d05c9ae52989f1fba31dcf83b9affd604204..4015ab3e91c499e50b0de8231ed766893ed05def 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/46.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/46.exercises/solution.md" @@ -24,7 +24,7 @@ public: if (i >= 0) { int j = nums.size() - 1; - ________________________ + ________________________; swap(nums.begin() + i, nums.begin() + j); } reverse(nums.begin() + i + 1, nums.end()); diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/47.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/47.exercises/solution.md" index bade446bd609b578dd783574dccc701dc407932c..c74b51d51699fcb42ae9c366c9f4b7f842c9a3ac 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/47.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/47.exercises/solution.md" @@ -28,7 +28,7 @@ private: if (last != nums[i]) { stack.push_back(nums[i]); - ____________________ + ____________________; stack.pop_back(); } last = nums[i]; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/48.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/48.exercises/solution.md" index 7988acb1a341564be59bc39fd7b5313c8d2f2cc1..38c66099f3cba38d10d214bb1e8fa8d9d6da88a6 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/48.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/48.exercises/solution.md" @@ -77,7 +77,7 @@ static char *simplifyPath(char *path) { for (i = 0; i < depth; i++) { - ____________________ + ____________________; } } *q = '\0'; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/49.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/49.exercises/solution.md" index f2b67217b2d172462bcdff8545642e973073e1bd..f1b28f0e73254468655ff141a40296cede4a696d 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/49.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/49.exercises/solution.md" @@ -34,7 +34,7 @@ struct ListNode *addTwoNumbers(struct ListNode *l1, struct ListNode *l2) pp->next = p = q; qp->next = NULL; } - ____________________ + ____________________; if (carry) { struct ListNode *n = (struct ListNode *)malloc(sizeof(struct ListNode)); diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.md" index 954a7e62ca18848d54a5e42c363cb7db0b89f996..9fd2de03622019e8e5feb1c3525db3733942e29a 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/50.exercises/solution.md" @@ -31,7 +31,7 @@ struct ListNode *partition(struct ListNode *head, int x) { if (p->val < x) { - __________________ + __________________; } else { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/51.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/51.exercises/solution.md" index 95a38589114ef4b68e9e3e5eab7d91ba2e562d7b..d1b76337a5e9c532e7a8705aff1146c83da6f7b2 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/51.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/51.exercises/solution.md" @@ -100,7 +100,7 @@ char *intToRoman(int num) int i = 0; while (num) { - ______________ + ______________; else { i++; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/52.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/52.exercises/solution.md" index 2cbf79848be898f7d0d928a07545c08543d4a7b0..cef571a015cd619ec8a72c824981e5827b7243b9 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/52.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/52.exercises/solution.md" @@ -32,7 +32,7 @@ private: { if (!used[i]) { - _____________________ + _____________________; stack.push_back(nums[i]); used[i] = true; dfs(nums, used, res); diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/53.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/53.exercises/solution.md" index 58aa2bd318d1dc398c1f4976a65d7b1c55fbe49f..430f8c5d2b35b19a59ea0e3d7650edaa401836dc 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/53.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/53.exercises/solution.md" @@ -14,7 +14,7 @@ int lengthOfLongestSubstring(char *s) memset(hset, 0, sizeof hset); for (; s[j]; j++) { - ___________________ + ___________________; } return m; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/54.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/54.exercises/solution.md" index eb1d0bef173440d32033e084cd0da08883d9194e..f4df80c9757f152d65df82e5982c44b56159e7e8 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/54.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/54.exercises/solution.md" @@ -46,7 +46,7 @@ static int numDecodings(char *s) int c = b; for (int i = 2; i <= len; i++) { - _________________ + _________________; a = b; b = c; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/55.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/55.exercises/solution.md" index 440414e2a9a0e5c0775ab41eae4b150443cd71a1..593fe2a7c462f38b08e5c971674470950597c36d 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/55.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/55.exercises/solution.md" @@ -33,7 +33,7 @@ public: unsigned int res = 0; while (dvd >= dvs) { - ________________ + ________________; } if (signal == 1 && res >= INT_MAX) { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.md" index d252ec0c349d0c8dec102c71023ad1466f1e28a5..cebcfba66de73ad1f1855f9a5e2544336750eebd 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/56.exercises/solution.md" @@ -30,7 +30,7 @@ public: { ans.push_back(matrix[i][col - 1 - cir]); } - __________________ + __________________; for (int i = row - 2 - cir; i > cir && (col - 1 - cir != cir); i--) { ans.push_back(matrix[i][cir]); diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/57.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/57.exercises/solution.md" index 6f33184b2d014441a7c6bee7ac814725efe5fbce..1c8155ee195c6edd876314c7eafe55f20e88e17f 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/57.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/57.exercises/solution.md" @@ -31,7 +31,7 @@ private: { if (!used[i]) { - _______________ + _______________; } } } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/58.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/58.exercises/solution.md" index 153956b6dfbc498f05dfcdbc9926726b701180fe..7335986e7cc27a8fcd28b69826883c1b0ba55788 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/58.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/58.exercises/solution.md" @@ -48,7 +48,7 @@ public: } if (nums[lo] <= nums[mid]) { - ____________ + ____________; } else { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.md" index eb83acfbca26109ac773a9796d9f1f45a119aa16..603ab23105403a7f46c33e5a79dfa6405e279cbe 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/59.exercises/solution.md" @@ -24,7 +24,7 @@ static int binary_search(int *nums, int len, int target) high = mid; } } - ______________________ + ______________________; else { return high; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/60.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/60.exercises/solution.md" index 06986df51575556cb1f68aae338d41b5282a48ee..8efe1d6cfab98c9882e2738c47c6d7bbd1c05532 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/60.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/60.exercises/solution.md" @@ -19,7 +19,7 @@ public: } else { - ___________________ + ___________________; } } private: diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/61.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/61.exercises/solution.md" index 8016d73bfdeafcf3e6183d1df0a199b690d6fa99..611f9798d761de2d53da02df563354418bce572e 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/61.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/61.exercises/solution.md" @@ -31,7 +31,7 @@ public: string key; for (int i : counts) { - ________________ + ________________; } ht[key].push_back(str); } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.md" index 9825fc6dd1e36640c2fd936f923e8b6c8c7d46eb..cc40b25be41c9a1d2b2f264dd18f4655544e1c8b 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/62.exercises/solution.md" @@ -30,7 +30,7 @@ public: { for (int n = 0; n < j; n++) { - __________________ + __________________; } } } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/63.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/63.exercises/solution.md" index 6299e49263c4464c6ef13071f8fd2d9277d2f237..cfbcfc79df56c506901e156c51482620c1a60dc5 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/63.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/63.exercises/solution.md" @@ -70,7 +70,7 @@ private: while (lo + 1 < hi) { int mid = lo + (hi - lo) / 2; - ______________ + ______________; } if (lo == -1 || nums[lo] != target) { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/64.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/64.exercises/solution.md" index e13083f48a17124d37e16dd4fd29a902216b3408..b5efe5a3e2a7f5603fd02b793590d753cb0522a9 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/64.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/64.exercises/solution.md" @@ -23,7 +23,7 @@ public: while (hi < nums.size() - 1) { int right = 0; - _______________________ + _______________________; hi = right; steps++; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.md" index 0b9c15302e5e2f515c63b5e786495861f2d174ca..ff8a65791e90c28117087e69183e79e3567ab3b3 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/65.exercises/solution.md" @@ -26,7 +26,7 @@ static struct ListNode *reverseBetween(struct ListNode *head, int m, int n) for (i = m; i < n; i++) { struct ListNode *q = p->next; - __________________ + __________________; } return dummy.next; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.md" index 3479efb04781a5c1cd960d941fee9f8b2a78831e..2528efd6b4422fb7e7ae94ecfd377e04ac3766c1 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/66.exercises/solution.md" @@ -37,7 +37,7 @@ int minPathSum(int **grid, int gridRowSize, int gridColSize) { for (j = 1; j < gridColSize; j++) { - _____________________ + _____________________; } } return dp[gridRowSize - 1][gridColSize - 1]; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/67.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/67.exercises/solution.md" index b8f5dc5a97b64a237b21ead75cc445f056d6fb1d..099365eb8e63e9de7612848ecc3d3ca71eb55a26 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/67.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/67.exercises/solution.md" @@ -27,7 +27,7 @@ public: pv.push_back(p); p = p->next; } - _________________ + _________________; p->next = p->next->next; return empty_node.next; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/68.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/68.exercises/solution.md" index d68eed9be67564273e1beeec656045055f03206f..887a0b3634e403ce2c9d469277e77a7112629843 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/68.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/68.exercises/solution.md" @@ -52,7 +52,7 @@ private: for (int i = start; i < candidates.size(); i++) { stack.push_back(candidates[i]); - _____________________________ + _____________________________; stack.pop_back(); } } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/69.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/69.exercises/solution.md" index 98b9dc2057b70903239d6e8a5f9eb6f854e2afcb..c398b624f7ce4a5fed2db8945c7eae992ac53efc 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/69.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/69.exercises/solution.md" @@ -39,7 +39,7 @@ public: break; } t--; - ________________ + ________________; } s[ti + maxlen] = 0; return s.c_str() + ti; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/70.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/70.exercises/solution.md" index 255644ae51d3e736f90aac06a7bf49b2e2ebe95b..d7bce7ebb13a85f27d70b6c47fe45ba3b499e8fb 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/70.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/70.exercises/solution.md" @@ -55,7 +55,7 @@ static bool search(int *nums, int numsSize, int target) } else if (nums[lo] <= nums[mid]) { - ___________________ + ___________________; } else { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/71.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/71.exercises/solution.md" index a3104c89e598586986524613a84c5af39ccdacbc..fec889f80bd9867979f95fec610baa12725fdaac 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/71.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/71.exercises/solution.md" @@ -47,7 +47,7 @@ static int removeDuplicates(int *nums, int numsSize) { if (nums[len] == nums[i]) { - _____________________ + _____________________; } else { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.md" index 733bc4e851cdda92536551d5ce05c0e060a548c1..d2ede5a0c575399d8aa945dea736e205fda17b73 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/72.exercises/solution.md" @@ -32,7 +32,7 @@ static bool isInterleave(char *s1, char *s2, char *s3) } for (i = 1; i < len2 + 1; i++) { - ____________________ + ____________________; } for (i = 1; i < len1 + 1; i++) { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/73.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/73.exercises/solution.md" index 5dda4df7dc8e101870186091fb46ed6ee4d6e50f..c5b43527cded64b5e4380c44db9d13800ea88ff0 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/73.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/73.exercises/solution.md" @@ -34,7 +34,7 @@ int **merge(int **intervals, int intervalsSize, int *intervalsColSize, int *retu if (tmp[i * 2] > intervals[len][1]) { len++; - ___________________________ + ___________________________; } else if (tmp[i * 2 + 1] > intervals[len][1]) { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/74.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/74.exercises/solution.md" index e6e64d74b3763bd15099808ff8458b58d8da22c2..f371a222024b9f4c100b3b6bc0ed033161e45706 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/74.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/74.exercises/solution.md" @@ -31,7 +31,7 @@ public: { r.emplace_back(vector({nums[cur], nums[left], nums[right]})); int t = left + 1; - __________________________ + __________________________; } else if (n > 0) { diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/75.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/75.exercises/solution.md" index 18216886309f96d21b8d1f8b7b1a6de61a544cd1..2a6f0ed3e9947c888d4c37cf8f81e4f3a953af12 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/75.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/75.exercises/solution.md" @@ -18,7 +18,7 @@ public: int j, carry = 0; for (j = num1.length() - 1; j >= 0; j--) { - _____________________ + _____________________; } res[i + j + 1] = carry + '0'; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/76.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/76.exercises/solution.md" index 33e9df20699d25505c5ee571b4e992e6de2e33bf..89ec3e3d3e92251b844a4048eec6638d13c16870 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/76.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/76.exercises/solution.md" @@ -31,7 +31,7 @@ public: { break; } - ____________________________ + ____________________________; else { int t = left + 1; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/77.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/77.exercises/solution.md" index 5d234cd4b02c1de5ac58fd0d42a9723a5cbe5ef1..5b85a6ea3aa5fe8b00494dfc463f076f5fceffa8 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/77.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/77.exercises/solution.md" @@ -17,7 +17,7 @@ static bool canJump(int *nums, int numsSize) int i, pos = 0; for (i = 0; i < numsSize - 1; i++) { - ___________________ + ___________________; pos = max(i + nums[i], pos); } return pos >= numsSize - 1; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.md" index 3657aa26d532eef537b640920e77fb0d551b75d2..5480fc78d35725385e24682476ba59c5859d2972 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/78.exercises/solution.md" @@ -36,7 +36,7 @@ static bool dfs(char *word, char **board, bool *used, } if (!result && col < col_size - 1 && !used[row * col_size + col + 1]) { - __________________________ + __________________________; } used[row * col_size + col] = false; return result; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.md" index 29e682c5631557c25ed3a5250316337000ec115e..c3dfde0beaabae59cfac38d2158625bd5ec1f76d 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/79.exercises/solution.md" @@ -69,7 +69,7 @@ public: { root = stk.top(); stk.pop(); - _______________________ + _______________________; } } return true; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.md" index 6ee6a07591bd1609881dbd327ef8f817b9bf91fc..224a97f1049394691d6efcfaf652e94c4381d026 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/80.exercises/solution.md" @@ -21,7 +21,7 @@ struct ListNode *deleteDuplicates(struct ListNode *head) p = q = head; while (p != NULL) { - _____________________ + _____________________; } return dummy.next; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/81.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/81.exercises/solution.md" index edddfa7d949de4f4ab9b58e627a1773eccee3f76..d438cafe68cac7a9152360a22e0768ebf3f242e8 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/81.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/81.exercises/solution.md" @@ -85,7 +85,7 @@ public: } if (left) { - _____________________ + _____________________; } } for (i = 0; i < full_cycles; ++i) diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/82.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/82.exercises/solution.md" index ce778bc167c28ac2a5b7d08c3079aa86ce059959..c34c0b13b164c268a3cf23b172beb6bd57981c42 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/82.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/82.exercises/solution.md" @@ -48,7 +48,7 @@ private: if (last != candidates[i]) { stack.push_back(candidates[i]); - _________________________________ + _________________________________; stack.pop_back(); } last = candidates[i]; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.md" index f7604d6ac1c1e4ce16a4c057a4888e54bd0f4519..aae11a0f087083afd68a9afaddf1b6c1ecaa5d68 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/83.exercises/solution.md" @@ -17,7 +17,7 @@ public: ans[0][0] = 1; while (cnt < n * n) { - ___________________ + ___________________; time++; } return ans; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.md" index 48f4f22ed903dc9f972ef08acd32cc6ac9456693..0919fc2a642e19b12bf4c2c799706532940495e8 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/84.exercises/solution.md" @@ -25,7 +25,7 @@ public: while (p != nullptr && p->next != nullptr) { struct ListNode *q = p->next; - _____________________ + _____________________; } return dummy.next; } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/85.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/85.exercises/solution.md" index 6d02989eae53bcba2986c6aed90bee49e8f63aa4..5919f12585b0d0fe4bbe15da4d36861c3c12e414 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/85.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/85.exercises/solution.md" @@ -30,7 +30,7 @@ public: j = nums.size() - 1; while (i < j) { - _____________________ + _____________________; swap(nums[i], nums[j]); } } diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.md" index 2b8e0c488291921d9e749801f1e3711882de71a2..6e68ee52284e8ba0fe88490496b7ef711db3ab53 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/86.exercises/solution.md" @@ -76,7 +76,7 @@ static int uniquePathsWithObstacles(int **obstacleGrid, int obstacleGridRowSize, int *line = obstacleGrid[row]; for (col = 1; col < obstacleGridColSize; col++) { - ________________________ + ________________________; } } return obstacleGrid[obstacleGridRowSize - 1][obstacleGridColSize - 1]; diff --git "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.md" index 34934f8d0c4c8e4c20ca76c72849bd948a951b60..cc9aa5af6c4d7ae4fe7a0f0a930768881ec82eeb 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/1.cpp/87.exercises/solution.md" @@ -88,7 +88,7 @@ public: vector mark(10); for (int i = sr; i < sr + 3; i++) { - ________________________ + ________________________; } } return true; diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/1.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/1.exercises/solution.md" index 22c72b9ce9409212a9ad489b9116c9ddc3525349..23979d3fc72f8f676d7b59b0b4a8664311a6825f 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/3.python/1.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/1.exercises/solution.md" @@ -23,7 +23,7 @@ def deal(data,flag): elif a==[]: a.append([i]) else: - _______________________ + _______________________; a.append([i]) target=sum(max(a,key=sum)) return list(filter(lambda x:sum(x)==target,a)) diff --git "a/data/2.dailycode\344\270\255\351\230\266/3.python/2.exercises/solution.md" "b/data/2.dailycode\344\270\255\351\230\266/3.python/2.exercises/solution.md" index 66bfe956431b0fe08737ca42e28a2830138f969a..41372faef2dcc6447caac492f4bed5a8a7ef2dff 100644 --- "a/data/2.dailycode\344\270\255\351\230\266/3.python/2.exercises/solution.md" +++ "b/data/2.dailycode\344\270\255\351\230\266/3.python/2.exercises/solution.md" @@ -30,7 +30,7 @@ def lcm(x, y): else: greater = y while(True): - ____________________ + ____________________; greater += 1 return lcm num1 = int(input("输入第一个数字: ")) diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/1.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/1.exercises/solution.md" index 8347615fe42cf514cc247d56ffae57b40bdc53d6..110ab13d234530aaa2f86f141fc0af095ef277f2 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/1.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/1.exercises/solution.md" @@ -26,7 +26,7 @@ int main() temp = 0; cin >> n1 >> n2 >> n3; temp += n1 * x + n2 * y + n3 * z; - __________________ + __________________; } cout << t << " " << min; return 0; diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/10.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/10.exercises/solution.md" index 9332028cd354b4ee711ea35f5f5ee1188ad7500d..442d35d71661360e7e6ebe734fb9d27642fc2046 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/10.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/10.exercises/solution.md" @@ -28,7 +28,7 @@ void solve() printf("\n"); for (j = 0; j < n; j++) { - ___________________ + ___________________; for (k = 1; k <= Y; k++) printf("%-3d", Min[k]); printf("\n"); diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/11.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/11.exercises/solution.md" index f73de102ff57908a8af7efbf9a8001a52b03f177..483836970ec682f53e9ab35c43c9a4c5722d3731 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/11.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/11.exercises/solution.md" @@ -46,7 +46,7 @@ int main() auto status = 0; for (; j < n; ++j) { - ______________ + ______________; } if (status == 0) { diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/12.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/12.exercises/solution.md" index 44ad81b105f42c1266588de055b0967a4e235030..fab6e0c0150a28f07814153de4824e4255c35131 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/12.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/12.exercises/solution.md" @@ -17,7 +17,7 @@ int main() { return 0; } int total(int x) { - _________________ + _________________; } ``` diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/13.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/13.exercises/solution.md" index f689707797bab5648ca13121023584c973617b59..725f1485e2eccad0d9b6aa24897fef5d43e1b022 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/13.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/13.exercises/solution.md" @@ -32,7 +32,7 @@ int main() } for (i = 1; i < strlen(a); i++) { - ________________ + ________________; } if (zyy && !fyy) { diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/14.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/14.exercises/solution.md" index beaa91bd336581c93b74a78e1d89595a29754eb1..428b9e18d7b8fa509f90205489c799df953465eb 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/14.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/14.exercises/solution.md" @@ -40,7 +40,7 @@ int main() for (long long i = 2; i <= c; i = sum / k + 1) { int t = num; - ________________ + ________________; } cout << "Case #" << count++ <<": " << num << endl; } diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/15.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/15.exercises/solution.md" index 4f0370308e7f527a483f9422e26d5a021f45c673..e4205a93b965b00269b4c0620b74c553f7b2af6f 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/15.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/15.exercises/solution.md" @@ -19,7 +19,7 @@ int sushu(int x) int i, j = 1; for (i = 2; i <= sqrt(x); i++) { - _______________ + _______________; } return j; } diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/16.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/16.exercises/solution.md" index 7335833fbe1237354e99ce5a0d778735a8c6a2df..6a33f679b7264de4c6c20640d911a6dec8dc7f8b 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/16.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/16.exercises/solution.md" @@ -26,7 +26,7 @@ int binary(int *a, int key, int n) mid = (left + right) / 2; while (left < right && a[mid] != key) { - _________________ + _________________; } if (a[mid] == key) return mid; diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/18.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/18.exercises/solution.md" index eade309e590c3b4432292195b00344c474502204..a5ca7aeddc8c284bb44bb149d0eb6901036aa456 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/18.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/18.exercises/solution.md" @@ -20,7 +20,7 @@ void paixu(float *p, int n) if (fabs(p[j]) < fabs(p[j + 1])) { float tmp; - _______________ + _______________; } } } diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/19.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/19.exercises/solution.md" index 48de848a549688d1ebc726559da2e7b4e634b247..07bbacbf95c859cdbd17c1883976816fe06099b5 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/19.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/19.exercises/solution.md" @@ -49,7 +49,7 @@ void shuchu(char *a, int m, int n) else { cout << a[(m + n) / 2]; - _______________________ + _______________________; } } int main() diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/2.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/2.exercises/solution.md" index 35f4df970020bec0e708a14ee7537506a9afbc7d..1dee2d51a644cd5a0161a33e00aac719f9a6c0f8 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/2.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/2.exercises/solution.md" @@ -31,7 +31,7 @@ void JosePhus(int n, int m, int start) { start--; int index = (start + m - 1) % sum; - ______________ + ______________; sum--; count++; } diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/20.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/20.exercises/solution.md" index 811b2f5049b97c4483f628fca61e7d00239750a9..358910968c9183d764ebd1fe15803b8d13c8926f 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/20.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/20.exercises/solution.md" @@ -19,7 +19,7 @@ #include using namespace std; static const double e = 1e-12; -_______________________________ +_______________________________; int main() { complex a, b, c; diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.md" index 178095aa97dd934636d94cdae805c4d432bf71aa..5df7e22e9aa7dd539d6bddb6e8aa1695d4f24585 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/21.exercises/solution.md" @@ -112,7 +112,7 @@ private: rows[row][i] = true; cols[col][i] = true; boxes[idx][i] = true; - _______________________________ + _______________________________; if (!ok) { rows[row][i] = false; diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.md" index 6b11b05e6449cd8b16a2cf268917f8d6da4a75a1..e461153423cb06b23f379f9d86833eda4ca4f272 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/22.exercises/solution.md" @@ -17,7 +17,7 @@ public: int right = height.size() - 1, right_max = 0; while (left < right) { - _____________________ + _____________________; } return res; } diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.md" index 9074caf7028345ede169f97f5eab276e7f63f529..289802c52755cb7444d5822458eebc0e107ac586 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/23.exercises/solution.md" @@ -33,7 +33,7 @@ static int largestRectangleArea(int *heights, int heightsSize) indexes[pos++] = i; } int max_area = 0; - _______________________ + _______________________; return max_area; } int main(void) diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/24.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/24.exercises/solution.md" index 4710d206b6ff35cfe1e024bbd383b018411d806b..79a8674ce17cbf31a0becb71c0a69f3b05edc307 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/24.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/24.exercises/solution.md" @@ -19,7 +19,7 @@ public: int i = 0; while (i < nums.size()) { - ____________________________ + ____________________________; } for (i = 0; i < nums.size(); i++) { diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.md" index df412fa0f8704af999d7eedbd97c1232e8dbc222..9e8a964898ac822955709cd696fade1074f92c9e 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/25.exercises/solution.md" @@ -63,7 +63,7 @@ private: if (row == 0 || !conflict(stack, row, i)) { stack[row] = i; - _______________________ + _______________________; } } return count; diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/3.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/3.exercises/solution.md" index 973ed704cdf1310f0093e1e24c38adb77a55d2a5..e671b8891310d007c63dc87b7632e97bdb298380 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/3.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/3.exercises/solution.md" @@ -116,7 +116,7 @@ int main() if (temp.time - 86400 >= old.time) { int tc = old.country; - _________________________ + _________________________; q.pop(); } else diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/4.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/4.exercises/solution.md" index 74892d9b3005de1d0cc5ac141968aece185c4bb2..9a00bbb93021652b438191b0468344abc31be342 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/4.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/4.exercises/solution.md" @@ -41,7 +41,7 @@ int main() t = -1; for (i = 0; i < n - 1; i++) { - ____________________ + ____________________; } b[j] = n - 1 - t; c[j] = n - 1; diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/5.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/5.exercises/solution.md" index 6cce0e68ef1288413cdbb88b4b5449dd3b89a665..b6529139fefd9974e6bfca7163ce82b6c77e173e 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/5.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/5.exercises/solution.md" @@ -65,7 +65,7 @@ void dfs(int x) } for (int i = 1; i < 13; ++i) { - ________________ + ________________; } } int main() diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/6.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/6.exercises/solution.md" index 098b419dd87dbe8d882958f054ece70328685acd..6bbc0c24088553b97e26f8e4f8585e64b10b228e 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/6.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/6.exercises/solution.md" @@ -20,7 +20,7 @@ int main() a = j; while (j != 0) { - ______________ + ______________; } j = a; if (sum == a) diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/7.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/7.exercises/solution.md" index 2b29d688f32f8edee788163fdf98f38d1683010e..b20fce6486a71d0c4db57632a970c75e68b676bf 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/7.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/7.exercises/solution.md" @@ -19,7 +19,7 @@ void InsertSort(int a[], int n) { int j = i - 1; int x = a[i]; - ________________ + ________________; } } } diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/8.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/8.exercises/solution.md" index 700ba31b5bad5899931b0f5ee33c40d10cf2c956..3fa4648ea7341dd3c2ca575bc2055cf7b083beff 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/8.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/8.exercises/solution.md" @@ -24,7 +24,7 @@ string StrCon(const string& a, const string& b) c += a[i]; c += b[i]; } - __________________ + __________________; return c; } int main() diff --git "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/9.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/9.exercises/solution.md" index f10b9418a9e745ee8395c89bf07e7407b8a85d10..b61caa5b82fb7ea2a5d2fb33eca657a9b501b95f 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/1.cpp/9.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/1.cpp/9.exercises/solution.md" @@ -18,7 +18,7 @@ int main() scanf("%d", &a[i]); if (i % 2 == 1) { - __________________ + __________________; } } for (i = n - 1; i >= 0; i--) diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/1.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/1.exercises/solution.md" index b5099ab90c2a8e12cb1f874d70ea77dab413d1b1..6f6a2d48d84f0daea002c0267162281546d27a1d 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/1.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/1.exercises/solution.md" @@ -41,7 +41,7 @@ def maze(m, n, route, pos, export): maze(m, n, route[:], (pos[0]+1,pos[1]), export) if pos[1] > 0 and m[pos[0]][pos[1]-1] == 0 and (pos[0],pos[1]-1) not in route: maze(m, n, route[:], (pos[0],pos[1]-1), export) - ________________________________ + ________________________________; m = [ [1,1,1,0,1,1,1,1,1,1], [1,0,0,0,0,0,0,0,1,1], diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/10.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/10.exercises/solution.md" index de5056dc17c417f86fffbe06ca6cf443de1408f6..4266726fa0f4ea74286ff1d4e1941005509e1730 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/10.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/10.exercises/solution.md" @@ -16,7 +16,7 @@ class Solution(object): if curr == '(': stack.append(i) else: - __________________ + __________________; tep, res = 0, 0 for t in data: if t == 1: diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.md" index 2763c016d1b95370ababdb87fe8a5929eef97203..c93b24c0554e3f7b38b4ce35011c735fec690d8e 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/11.exercises/solution.md" @@ -23,7 +23,7 @@ class Solution(object): for i in range(pos): for j in range(ls): if board[i][j] == 'Q': - ______________________ + ______________________; for j in range(ls): if check[j]: board[pos][j] = 'Q' diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/12.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/12.exercises/solution.md" index 5cf0c4d534866d005f170c72767544926259f8c4..0eed7542f7b46f3be61eb7937078ce3106185242 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/12.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/12.exercises/solution.md" @@ -75,7 +75,7 @@ class Solution(object): return memo[s1, s2] n = len(s1) for i in range(1, n): - ___________________________ + ___________________________; memo[s1, s2] = False return False # %% diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.md" index 3c3bc4a78e3814f6cab0589b875c31434899d325..d980cd19f2fb7d0653413cf1bb85c02975b613f4 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/13.exercises/solution.md" @@ -41,7 +41,7 @@ class Solution(object): temp.next = head head = temp start = head - _________________ + _________________; return head.next def reverseList(self, head, end): pos = head.next diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/14.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/14.exercises/solution.md" index 55560d53a959e7daed5fec2bd55ead4ff308c64f..8a4a568b11f94acfdcb6ec9b69ec4c0494201a44 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/14.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/14.exercises/solution.md" @@ -17,7 +17,7 @@ class Solution(object): while pos < ls and s[pos].isdigit(): pos += 1 isNumeric = True - _____________________________ + _____________________________; elif pos < ls and s[pos] == 'e' and isNumeric: isNumeric = False pos += 1 diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/15.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/15.exercises/solution.md" index 03f095e9d6fb594b0a721e8a5aa8ad708c016424..d134c45380558f74319416a71195ec8b6cd96b8d 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/15.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/15.exercises/solution.md" @@ -28,7 +28,7 @@ class Solution(object): except KeyError: target_dict[word] = 1 res = [] - ___________________________________ + ___________________________________; curr_dict = target_dict.copy() for pos in range(start, start + word_ls * len(words), word_ls): curr = s[pos:pos + word_ls] diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/16.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/16.exercises/solution.md" index 907e50826def74df85e10abef03740a65fd4232c..0b0ccc9769fd12105d615123dc9fbc38a5cdf8d0 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/16.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/16.exercises/solution.md" @@ -39,7 +39,7 @@ class Solution: if na % 2 == 1: return ns[d - 1] else: - return _____________________ + return _____________________; # %% diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/17.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/17.exercises/solution.md" index 3616e8ef00f24a0826202f23f473cb6225437a7a..a49129a1ade36246726581964a93850549153a27 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/17.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/17.exercises/solution.md" @@ -24,7 +24,7 @@ class Solution(object): count += 1 if count == ls_t: begin_index = ord(s[begin]) - ____________________________ + ____________________________; if window_ls < min_window: min_begin = begin min_end = end diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/18.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/18.exercises/solution.md" index 5b0e99aaeb201208baf04609bf0b28063f52df1f..536c58f31d575c42f116dd2ef3c4400667c3f9b8 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/18.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/18.exercises/solution.md" @@ -68,7 +68,7 @@ class Solution(object): return l1 head = curr = ListNode(-1) while l1 is not None and l2 is not None: - ____________________ + ____________________; curr = curr.next if l1 is not None: curr.next = l1 diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/19.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/19.exercises/solution.md" index f1a10ae5b6185fa744813093fc6a645c69ff08c7..872aa917ceb11f1e785b49b7db5c471dd61b1b82 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/19.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/19.exercises/solution.md" @@ -31,7 +31,7 @@ class Solution(object): else: c = k // step res[0] += s[c] - ____________________ + ____________________; return s = "" diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.md" index 98d2005572c5304af771eded223273353dbca682..cd6e1be59461e6663ccc3be018c6dcb16b97a4e4 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/2.exercises/solution.md" @@ -64,7 +64,7 @@ class Solution(object): for n in range(9): if n!=j and board[i][n]==board[i][j]: return False - ______________________ + ______________________; return True def f(a,b,board): for i in range(a,9): diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/20.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/20.exercises/solution.md" index 19da84e00aa2bccf80d5804e1306d4b62a5e8d17..819248e2f5f3e1eb8f5d8023a950db2f752c55cd 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/20.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/20.exercises/solution.md" @@ -19,7 +19,7 @@ class Solution(object): if p_index < p_len and (s[s_index] == p[p_index] or p[p_index] == '?'): s_index += 1 p_index += 1 - ______________________ + ______________________; elif star != -1: p_index = star + 1 s_star += 1 diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/21.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/21.exercises/solution.md" index cdf4516e8c3fb746b658bf40f79031e60866d17a..a6b82a3e4ad9b46b3ad38c19cea98bfbbdaf8d21 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/21.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/21.exercises/solution.md" @@ -11,7 +11,7 @@ class Solution: return len(s) == 0 head_match = len(s) > 0 and (s[0] == p[0] or p[0] == '.') if len(p) > 1 and p[1] == '*': - __________________________ + __________________________; else: if not head_match: return False diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.md" index 88532a2b9129d8ae357d37cbe6ee3bc5a796436a..485d2174b3896a97d858bbb51473f8ddd04d0caf 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/3.exercises/solution.md" @@ -35,7 +35,7 @@ class Solution(object): if end - start <= 1: return 0 min_m = min(height[start], height[end]) - _________________________ + _________________________; step = 0 for index in range(start + 1, end): if height[index] > 0: diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.md" index 93646f84c53271ba685c0deb9c6599567360e8ff..3e02ac298fe2e0c1ca07d2634b944f1c7ee01b5c 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/4.exercises/solution.md" @@ -17,7 +17,7 @@ class Solution(object): top, pos = 0, 0 for pos in range(ls): while top > 0 and heights[stack[top]] > heights[pos]: - _____________________________ + _____________________________; top -= 1 stack.pop() stack.append(pos) diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/5.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/5.exercises/solution.md" index 02a432282cec4bea640836fd9eefabc9b8f6c0f6..37be506036821c0f1b4f80e1bf7edce5c4717ff8 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/5.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/5.exercises/solution.md" @@ -16,7 +16,7 @@ class Solution(object): pos = nums[index] - 1 nums[index], nums[pos] = nums[pos], nums[index] res = 0 - _________________________ + _________________________; return res + 1 # %% s = Solution() diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.md" index e7c666282a92b25d0f13423f2cd27c3e30689b07..42047179f528d277cf773745f7eada3a2de0bbd6 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/6.exercises/solution.md" @@ -53,7 +53,7 @@ class Solution(object): isDigSafe = (1 << (n - 1 + row - index)) & diag == 0 isAntiDiagSafe = (1 << (row + index)) & antiDiag == 0 if isAntiDiagSafe and isColSafe and isDigSafe: - _________________________ + _________________________; if __name__ == '__main__': s = Solution() print (s.totalNQueens(4)) diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.md" index f93a8bce172c408cff0b43ad14a68a87c3eb4288..a761b338af766f59193c7dcc131693a2449de537 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/7.exercises/solution.md" @@ -28,7 +28,7 @@ class Solution(object): left[j] = max(left[j], curr_left) else: left[j], curr_left = 0, j + 1 - _______________________ + _______________________; for j in range(ls_col): maxA = max(maxA, (right[j] - left[j]) * height[j]) return maxA diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/8.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/8.exercises/solution.md" index c749340a9e5b687f65ec201af975d1da8415fd0f..5cd13b3b13f7ffc9573816f1d268d781ad99d746 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/8.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/8.exercises/solution.md" @@ -17,7 +17,7 @@ class Solution(object): if word1[i - 1] == word2[j - 1]: dp[i] = pre else: - ____________________________ + ____________________________; pre = temp return dp[ls_1] if __name__ == '__main__': diff --git "a/data/3.dailycode\351\253\230\351\230\266/3.python/9.exercises/solution.md" "b/data/3.dailycode\351\253\230\351\230\266/3.python/9.exercises/solution.md" index ae4b7da8be7366f54c3ecbeffe2a09e97f7fdab0..823d43ff7d5f72d24db47fb13474771d9ea18131 100644 --- "a/data/3.dailycode\351\253\230\351\230\266/3.python/9.exercises/solution.md" +++ "b/data/3.dailycode\351\253\230\351\230\266/3.python/9.exercises/solution.md" @@ -101,7 +101,7 @@ class Solution(object): text = ' '.join(curr) text += ' ' * (maxWidth - remain - len(curr) + 1) else: - ___________________________ + ___________________________; res.append(text) return res if __name__ == '__main__':