From 39ee7eca6b7691932762c3279eed0ab145733411 Mon Sep 17 00:00:00 2001 From: LetMeFly666 <814114971@qq.com> Date: Thu, 12 Dec 2024 22:49:49 +0800 Subject: [PATCH 1/2] docs(fix): learn git(bug) Signed-off-by: LetMeFly666 <814114971@qq.com> --- ...00\345\244\247\345\274\200\351\224\200.md" | 22 ++-- Solutions/Other-Accumulation-SomeTips.md | 107 +++++++++++++++++- d.bash | 0 t | 4 - 4 files changed, 114 insertions(+), 19 deletions(-) create mode 100644 d.bash delete mode 100644 t diff --git "a/Solutions/LeetCode 2931.\350\264\255\344\271\260\347\211\251\345\223\201\347\232\204\346\234\200\345\244\247\345\274\200\351\224\200.md" "b/Solutions/LeetCode 2931.\350\264\255\344\271\260\347\211\251\345\223\201\347\232\204\346\234\200\345\244\247\345\274\200\351\224\200.md" index 60d3abb417bd..96a4c51bba66 100644 --- "a/Solutions/LeetCode 2931.\350\264\255\344\271\260\347\211\251\345\223\201\347\232\204\346\234\200\345\244\247\345\274\200\351\224\200.md" +++ "b/Solutions/LeetCode 2931.\350\264\255\344\271\260\347\211\251\345\223\201\347\232\204\346\234\200\345\244\247\345\274\200\351\224\200.md" @@ -84,17 +84,17 @@ tags: [题解, LeetCode, 困难, 贪心, 数组, 矩阵, 排序, 堆（优先队 直接调用库函数排序就没有利用“每个商家的商品非递增”这一特性，且排序复杂度$mn\log (mn)$ 平均大于 $mn\times m$。 > | $ m $ | $mn\log (mn)\gt mn\times m$ | -> |:-------:|:144428274:| -> | 1 | $$ n \geq 3 $$ | -> | 2 | $$ n \geq 5 $$ | -> | 3 | $$ n \geq 9 $$ | -> | 4 | $$ n \geq 17 $$ | -> | 5 | $$ n \geq 33 $$ | -> | 6 | $$ n \geq 65 $$ | -> | 7 | $$ n \geq 129 $$| -> | 8 | $$ n \geq 257 $$| -> | 9 | $$ n \geq 513 $$| -> | 10 | $$ n \geq 1025 $$ | +> |:-------:|:---:| +> | 1 | $ n \geq 3 $ | +> | 2 | $ n \geq 5 $ | +> | 3 | $ n \geq 9 $ | +> | 4 | $ n \geq 17 $ | +> | 5 | $ n \geq 33 $ | +> | 6 | $ n \geq 65 $ | +> | 7 | $ n \geq 129 $| +> | 8 | $ n \geq 257 $| +> | 9 | $ n \geq 513 $| +> | 10 | $ n \geq 1025 $ | 因此，我们可以使用$m$个指针，每个指针指向这家商店购买到了哪件商品，每次从$m$家里选择最便宜的那件就好。 diff --git a/Solutions/Other-Accumulation-SomeTips.md b/Solutions/Other-Accumulation-SomeTips.md index 77e6be9b683c..116efb2e34c5 100644 --- a/Solutions/Other-Accumulation-SomeTips.md +++ b/Solutions/Other-Accumulation-SomeTips.md @@ -32,10 +32,109 @@ git clone --branch paper --single-branch git@github.com:LetMeFly666/SecFFT.git + 上100个版本：`HEAD~100` ```bash -git reset --hard HEAD^ -``` - -其中`--hard`会回退到上个版本的已提交状态，`--soft`会回退到上个版本的未提交状态，`--mixed`会回退到上个版本已添加但未提交的状态。 +git reset --hard/--soft/--mixed HEAD^ +``` + +下面先别看了，写的不对 + +其中`--hard`会强制变成上个版本（工作区暂存区清空），`--soft`会将相对上一个版本的变化放到暂存区，`--mixed`(默认选项)会将相对上一个版本的变化放到工作区。 + +举个例子： + +> 创建一个空的git目录，添加文件1并commit，添加文件2并commit，添加文件3并放到暂存区(git add)。 +> +> ```bash +> mkdir LetGit +> cd LetGit +> git init +> +> echo 1 > 1 +> git add 1 +> git commit -m "1" +> +> echo 2 > 2 +> git add 2 +> git commit -m "2" +> +> echo 3 > 3 +> git add 3 +> # 文件3不做commit +> +> git log +> # commit 0236bc83d4ad4bfc91d3235c732ef7f940d4e5cd (HEAD -> master) +> # Author: LetMeFly666 <814114971@qq.com> +> # Date: Thu Dec 12 22:04:28 2024 +0800 +> # +> # 2 +> # +> # commit 9878b30ab7cae61d9211962d9ac0aec8e7da434a +> # Author: LetMeFly666 <814114971@qq.com> +> # Date: Thu Dec 12 22:04:28 2024 +0800 +> # +> # 1 +> # +> +> git status +> # On branch master +> # Changes to be committed: +> # (use "git restore --staged ..." to unstage) +> # new file: 3 +> +> ``` +> +> 这时候，分别**在此基础上**进行下述三种操作： +> +> > ```bash +> > git reset --hard HEAD^ +> > ``` +> > +> > 则已经被commit的2和刚被add到暂存区的3都会被丢弃！（其实丢弃的是`HEAD^`之后的“更改”。） +> > +> > ```bash +> > git status +> > # On branch master +> > # nothing to commit, working tree clean +> > ``` +> +> 亦或者： +> +> > ```bash +> > git reset --soft HEAD^ +> > ``` +> > +> > 则已经被commit的2和刚被add到暂存区的3都会被放到暂存区 +> > +> > ```bash +> > git status +> > # On branch master +> > # Changes to be committed: +> > # (use "git restore --staged ..." to unstage) +> > # new file: 2 +> > # new file: 3 +> > ``` +> +> 使用`git reset --hard 0236b`、`echo 3 > 3`、`git add 3`命令来恢复到实验开始时的状态，使用`--mixed`进行测试： +> +> > ```bash +> > git reset --mixed HEAD^ +> > ``` +> > +> > 则已经被commit的2和刚被add到暂存区的3都会被放到工作区 +> > +> > ```bash +> > git status +> > # On branch master +> > # Untracked files: +> > # (use "git add ..." to include in what will be committed) +> > # 2 +> > # 3 +> > # +> > # nothing added to commit but untracked files present (use "git add" to track) +> > ``` +> +> 注意Windows系统中`cmd`中的`^`大概是连接符的意思，可以使用`git reset --hard "HEAD^"`或`git reset --hard HEAD"^"`或`git reset --hard HEAD^^`来表示`HEAD^`。 +> +> 请注意，如果有未跟踪的内容（例如`echo 4 > 4`但是不`git add`），那么无论`git reset`时传递哪个参数，文件`4`都会原封不动地躺在工作区（这是因为历史记录中也没有文件`4`） TODO: 历史记录中存在文件4 #### 查看日志/commit记录 diff --git a/d.bash b/d.bash new file mode 100644 index 000000000000..e69de29bb2d1 diff --git a/t b/t deleted file mode 100644 index 4d436fa1ff54..000000000000 --- a/t +++ /dev/null @@ -1,4 +0,0 @@ -学弟，我今晚大概率是改不了了[发抖] - -学弟着急的话，BUG在后端那个项目里，应该就在屏幕范围内，有一个很多级的try except。 -大概就是这里出的问题，可以先把try都改成if True，except都改成else，这样重启一下后端，前端再次访问的时候后端大概就会 \ No newline at end of file From a6db8cc3f55e4a616d3f124a3ee1d03c2d15bee5 Mon Sep 17 00:00:00 2001 From: LetMeFly666 <814114971@qq.com> Date: Fri, 13 Dec 2024 09:46:53 +0800 Subject: [PATCH 2/2] =?UTF-8?q?update:=20=E6=B7=BB=E5=8A=A0=E9=97=AE?= =?UTF-8?q?=E9=A2=98=E2=80=9C3264.K=E6=AC=A1=E4=B9=98=E8=BF=90=E7=AE=97?= =?UTF-8?q?=E5=90=8E=E7=9A=84=E6=9C=80=E7=BB=88=E6=95=B0=E7=BB=84I?= =?UTF-8?q?=E2=80=9D=E7=9A=84=E4=BB=A3=E7=A0=81=E5=92=8C=E9=A2=98=E8=A7=A3?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...te-after-k-multiplication-operations-i.cpp | 26 +++ ...ate-after-k-multiplication-operations-i.go | 20 ++ ...e-after-k-multiplication-operations-i.java | 21 ++ ...ate-after-k-multiplication-operations-i.py | 17 ++ README.md | 1 + ...0\347\273\210\346\225\260\347\273\204I.md" | 198 ++++++++++++++++++ Solutions/Other-Accumulation-SomeTips.md | 14 +- .../Other-English-LearningNotes-SomeWords.md | 8 +- tryGoPy/CHANGELOG.md | 88 -------- ...\204\232\346\234\254\347\232\204output.md" | 81 ------- 10 files changed, 301 insertions(+), 173 deletions(-) create mode 100644 Codes/3264-final-array-state-after-k-multiplication-operations-i.cpp create mode 100644 Codes/3264-final-array-state-after-k-multiplication-operations-i.go create mode 100644 Codes/3264-final-array-state-after-k-multiplication-operations-i.java create mode 100644 Codes/3264-final-array-state-after-k-multiplication-operations-i.py create mode 100644 "Solutions/LeetCode 3264.K\346\254\241\344\271\230\350\277\220\347\256\227\345\220\216\347\232\204\346\234\200\347\273\210\346\225\260\347\273\204I.md" delete mode 100644 tryGoPy/CHANGELOG.md delete mode 100644 "tryGoPy/temp-20241206-\345\233\236\345\233\275\345\220\216-\350\207\252\345\212\250\350\204\232\346\234\254\347\232\204output.md" diff --git a/Codes/3264-final-array-state-after-k-multiplication-operations-i.cpp b/Codes/3264-final-array-state-after-k-multiplication-operations-i.cpp new file mode 100644 index 000000000000..9413a141ca37 --- /dev/null +++ b/Codes/3264-final-array-state-after-k-multiplication-operations-i.cpp @@ -0,0 +1,26 @@ +/* + * @Author: LetMeFly + * @Date: 2024-12-13 09:32:29 + * @LastEditors: LetMeFly.xyz + * @LastEditTime: 2024-12-13 09:33:35 + */ +#ifdef _WIN32 +#include "_[1,2]toVector.h" +#endif + +class Solution { +public: + vector getFinalState(vector& nums, int k, int multiplier) { + while (k--) { + int m = nums[0], loc = 0; + for (int i = 1; i < nums.size(); i++) { + if (nums[i] < m) { + m = nums[i]; + loc = i; + } + } + nums[loc] *= multiplier; + } + return nums; + } +}; \ No newline at end of file diff --git a/Codes/3264-final-array-state-after-k-multiplication-operations-i.go b/Codes/3264-final-array-state-after-k-multiplication-operations-i.go new file mode 100644 index 000000000000..402faee6e5be --- /dev/null +++ b/Codes/3264-final-array-state-after-k-multiplication-operations-i.go @@ -0,0 +1,20 @@ +/* + * @Author: LetMeFly + * @Date: 2024-12-13 09:40:31 + * @LastEditors: LetMeFly.xyz + * @LastEditTime: 2024-12-13 09:42:10 + */ +package main + +func getFinalState(nums []int, k int, multiplier int) []int { + for round := 0; round < k; round++ { + m, loc := nums[0], 0 + for i, val := range nums { + if val < m { + m, loc = val, i + } + } + nums[loc] *= multiplier + } + return nums +} \ No newline at end of file diff --git a/Codes/3264-final-array-state-after-k-multiplication-operations-i.java b/Codes/3264-final-array-state-after-k-multiplication-operations-i.java new file mode 100644 index 000000000000..82914b86ce95 --- /dev/null +++ b/Codes/3264-final-array-state-after-k-multiplication-operations-i.java @@ -0,0 +1,21 @@ +/* + * @Author: LetMeFly + * @Date: 2024-12-13 09:37:28 + * @LastEditors: LetMeFly.xyz + * @LastEditTime: 2024-12-13 09:40:00 + */ +class Solution { + public int[] getFinalState(int[] nums, int k, int multiplier) { + for (int round = 0; round < k; round++) { + int m = nums[0], loc = 0; + for (int i = 1; i < nums.length; i++) { + if (nums[i] < m) { + m = nums[i]; + loc = i; + } + } + nums[loc] *= multiplier; + } + return nums; + } +} \ No newline at end of file diff --git a/Codes/3264-final-array-state-after-k-multiplication-operations-i.py b/Codes/3264-final-array-state-after-k-multiplication-operations-i.py new file mode 100644 index 000000000000..18c7767e3c63 --- /dev/null +++ b/Codes/3264-final-array-state-after-k-multiplication-operations-i.py @@ -0,0 +1,17 @@ +''' +Author: LetMeFly +Date: 2024-12-13 09:34:55 +LastEditors: LetMeFly.xyz +LastEditTime: 2024-12-13 09:36:26 +''' +from typing import List + +class Solution: + def getFinalState(self, nums: List[int], k: int, multiplier: int) -> List[int]: + for _ in range(k): + m, loc = nums[0], 0 + for i, val in enumerate(nums): + if val < m: + m, loc = val, i + nums[loc] *= multiplier + return nums \ No newline at end of file diff --git a/README.md b/README.md index 4da12284ef02..4a307b514ede 100644 --- a/README.md +++ b/README.md @@ -739,6 +739,7 @@ |3255.长度为K的子数组的能量值II|中等|题目地址|题解地址|CSDN题解|LeetCode题解| |3258.统计满足K约束的子字符串数量I|简单|题目地址|题解地址|CSDN题解|LeetCode题解| |3259.超级饮料的最大强化能量|中等|题目地址|题解地址|CSDN题解|LeetCode题解| +|3264.K次乘运算后的最终数组I|简单|题目地址|题解地址|CSDN题解|LeetCode题解| |剑指Offer0047.礼物的最大价值|简单|题目地址|题解地址|CSDN题解|LeetCode题解| |剑指OfferII0041.滑动窗口的平均值|简单|题目地址|题解地址|CSDN题解|LeetCode题解| |剑指OfferII0091.粉刷房子|中等|题目地址|题解地址|CSDN题解|LeetCode题解| diff --git "a/Solutions/LeetCode 3264.K\346\254\241\344\271\230\350\277\220\347\256\227\345\220\216\347\232\204\346\234\200\347\273\210\346\225\260\347\273\204I.md" "b/Solutions/LeetCode 3264.K\346\254\241\344\271\230\350\277\220\347\256\227\345\220\216\347\232\204\346\234\200\347\273\210\346\225\260\347\273\204I.md" new file mode 100644 index 000000000000..43add51ccc75 --- /dev/null +++ "b/Solutions/LeetCode 3264.K\346\254\241\344\271\230\350\277\220\347\256\227\345\220\216\347\232\204\346\234\200\347\273\210\346\225\260\347\273\204I.md" @@ -0,0 +1,198 @@ +--- +title: 3264.K 次乘运算后的最终数组 I +date: 2024-12-13 09:43:07 +tags: [题解, LeetCode, 简单, 数组, 数学, 模拟, 堆（优先队列）] +--- + +# 【LetMeFly】3264.K 次乘运算后的最终数组 I：模拟 + +力扣题目链接：[https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-i/](https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-i/) + +

给你一个整数数组 nums ，一个整数 k  和一个整数 multiplier 。

+ +

你需要对 nums 执行 k 次操作，每次操作中：

+ +
    +
  • 找到 nums 中的 最小 值 x ，如果存在多个最小值，选择最 前面 的一个。
    • +
  • 将 x 替换为 x * multiplier 。
    • +
+ +

请你返回执行完 k 次乘运算之后，最终的 nums 数组。

+ +

 

+ +

示例 1：

+ +
+

输入：nums = [2,1,3,5,6], k = 5, multiplier = 2

+ +

输出：[8,4,6,5,6]

+ +

解释：

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
操作结果
1 次操作后[2, 2, 3, 5, 6]
2 次操作后[4, 2, 3, 5, 6]
3 次操作后[4, 4, 3, 5, 6]
4 次操作后[4, 4, 6, 5, 6]
5 次操作后[8, 4, 6, 5, 6]
+
+ +

示例 2：

+ +
+

输入：nums = [1,2], k = 3, multiplier = 4

+ +

输出：[16,8]

+ +

解释：

+ + + + + + + + + + + + + + + + + + + + +
操作结果
1 次操作后[4, 2]
2 次操作后[4, 8]
3 次操作后[16, 8]
+
+ +

 

+ +

提示：

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 1 <= nums[i] <= 100
    • +
  • 1 <= k <= 10
    • +
  • 1 <= multiplier <= 5
    • +
+ + + +## 解题方法：模拟 + +进行$k$次如下操作： + +> 每次找到最小值所在位置，将最小值乘以$multiplier$ + +最后返回$nums$原数组。 + ++ 时间复杂度$O(len(nums)\times k)$ ++ 空间复杂度$O(1)$ + +### AC代码 + +#### C++ + +```cpp +class Solution { +public: + vector getFinalState(vector& nums, int k, int multiplier) { + while (k--) { + int m = nums[0], loc = 0; + for (int i = 1; i < nums.size(); i++) { + if (nums[i] < m) { + m = nums[i]; + loc = i; + } + } + nums[loc] *= multiplier; + } + return nums; + } +}; +``` + +#### Python + +```python +from typing import List + +class Solution: + def getFinalState(self, nums: List[int], k: int, multiplier: int) -> List[int]: + for _ in range(k): + m, loc = nums[0], 0 + for i, val in enumerate(nums): + if val < m: + m, loc = val, i + nums[loc] *= multiplier + return nums +``` + +#### Java + +```java +class Solution { + public int[] getFinalState(int[] nums, int k, int multiplier) { + for (int round = 0; round < k; round++) { + int m = nums[0], loc = 0; + for (int i = 1; i < nums.length; i++) { + if (nums[i] < m) { + m = nums[i]; + loc = i; + } + } + nums[loc] *= multiplier; + } + return nums; + } +} +``` + +#### Go + +```go +package main + +func getFinalState(nums []int, k int, multiplier int) []int { + for round := 0; round < k; round++ { + m, loc := nums[0], 0 + for i, val := range nums { + if val < m { + m, loc = val, i + } + } + nums[loc] *= multiplier + } + return nums +} +``` + +> 同步发文于CSDN和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2024/12/13/LeetCode%203264.K%E6%AC%A1%E4%B9%98%E8%BF%90%E7%AE%97%E5%90%8E%E7%9A%84%E6%9C%80%E7%BB%88%E6%95%B0%E7%BB%84I/)哦~ +> +> Tisfy：[https://letmefly.blog.csdn.net/article/details/144442552](https://letmefly.blog.csdn.net/article/details/144442552) diff --git a/Solutions/Other-Accumulation-SomeTips.md b/Solutions/Other-Accumulation-SomeTips.md index 116efb2e34c5..ebfdad8e7e75 100644 --- a/Solutions/Other-Accumulation-SomeTips.md +++ b/Solutions/Other-Accumulation-SomeTips.md @@ -35,9 +35,17 @@ git clone --branch paper --single-branch git@github.com:LetMeFly666/SecFFT.git git reset --hard/--soft/--mixed HEAD^ ``` -下面先别看了，写的不对 +其中： -其中`--hard`会强制变成上个版本（工作区暂存区清空），`--soft`会将相对上一个版本的变化放到暂存区，`--mixed`(默认选项)会将相对上一个版本的变化放到工作区。 ++ `--hard`会强制变成上个版本（工作区暂存区清空） ++ `--soft`会将相对上一个版本的变化保留到暂存区和工作区（已经add到暂存区过的变化还在暂存区 未add的变化还在工作区） ++ `--mixed`(默认选项)会将相对上一个版本的变化全部放到工作区。 + +另一个解释版本： + ++ `--hard`：完全回退提交，丢弃暂存区和文件的所有修改。 ++ `--soft`：回退提交，但保留文件和暂存区的修改。 ++ `--mixed`：回退提交，丢弃暂存区的修改，但保留文件的修改。 举个例子： @@ -134,7 +142,7 @@ git reset --hard/--soft/--mixed HEAD^ > > 注意Windows系统中`cmd`中的`^`大概是连接符的意思，可以使用`git reset --hard "HEAD^"`或`git reset --hard HEAD"^"`或`git reset --hard HEAD^^`来表示`HEAD^`。 > -> 请注意，如果有未跟踪的内容（例如`echo 4 > 4`但是不`git add`），那么无论`git reset`时传递哪个参数，文件`4`都会原封不动地躺在工作区（这是因为历史记录中也没有文件`4`） TODO: 历史记录中存在文件4 +> 如果有**从**未跟踪的内容（例如`echo 4 > 4`但是不`git add`），那么无论`git reset`时传递哪个参数，文件`4`都会原封不动地躺在工作区（这是因为历史记录中也没有文件`4`） #### 查看日志/commit记录 diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md index 3289236cfe65..52a0fb012230 100644 --- a/Solutions/Other-English-LearningNotes-SomeWords.md +++ b/Solutions/Other-English-LearningNotes-SomeWords.md @@ -596,7 +596,7 @@ tags: [其他, 知识, 英语, Notes] |inlet|n. 水湾，小港，注入口|||| |drench|v. 使湿透
n. 弄湿，雨淋，浸渍液，(制革时浸泡熟皮的)脱灰水| ||| -|inundate|v. 淹没，使不胜负荷，使应接不暇，泛滥| +|inundate|v. 淹没，使不胜负荷，使应接不暇，泛滥| |thrash|v. 抽打，痛打，猛烈扭动，彻底击败| |shovel|n. 铲，铲斗，一铲的量
v. 铲，铲起| |deceitful|adj. 不诚实的，骗人的| @@ -857,6 +857,12 @@ tags: [其他, 知识, 英语, Notes] |clown|n. 丑角，小丑，蠢货，笨蛋
v. 做出蠢相，扮小丑| |triangular|adj. 三角形的，涉及三方的| |Marxist|adj. 马克思主义的
n. 马克思主义者| +||| +|dart|v. 急冲，突进，投掷(标枪等)，放射
n. 标枪，箭，刺，镳| +|disgrace|n. 耻辱，丢脸，不光彩
v. 使丢脸，使蒙羞，使名誉扫地| +|monopolize|v. 垄断，独占，包办，占去(某人的大部分注意力/时间)| +|exasperation|n. 愤怒，激化，加剧| +|layday|n. 约定装卸日(航运合同中的一个名词)|

单词收录总数

diff --git a/tryGoPy/CHANGELOG.md b/tryGoPy/CHANGELOG.md deleted file mode 100644 index 4f9bc2b1e573..000000000000 --- a/tryGoPy/CHANGELOG.md +++ /dev/null @@ -1,88 +0,0 @@ - -PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git pull origin master -remote: Enumerating objects: 47, done. -remote: Counting objects: 100% (47/47), done. -remote: Compressing objects: 100% (25/25), done. 347\232\204\346\243\213\345\255\220\346\225\260\346\250\241\346\213\237-144303138.md" -remote: Total 47 (delta 20), reused 45 (delta 19), pack-reused 0 (from 0) -Unpacking objects: 100% (47/47), 27.96 KiB | 10.00 KiB/s, done. 3-144123453.md" -From ssh.github.com:LetMeFly666/LeetCode - * branch master -> FETCH_HEAD - cd0c22da603..9392e7b5778 master -> origin/master -Updating cd0c22da603..9392e7b5778 -Fast-forward - Codes/0935-knight-dialer.cpp | 46 ++++ - Codes/0935-knight-dialer.go | 41 ++++ - Codes/0935-knight-dialer.java | 42 ++++ - Codes/0935-knight-dialer.py | 31 +++ - ...rmine-color-of-a-chessboard-square_20241209.cpp | 16 ++ - ...ermine-color-of-a-chessboard-square_20241209.go | 11 + - ...mine-color-of-a-chessboard-square_20241209.java | 11 + - ...ermine-color-of-a-chessboard-square_20241209.py | 9 + - README.md | 4 +- - ...243\253\346\213\250\345\217\267\345\231\250.md" | 250 +++++++++++++++++++++ - ...255\220\347\232\204\351\242\234\350\211\262.md" | 28 +++ - .../Other-AI-FL-FederatedLearning-KaiTiBaoGao.md | 197 ++++++++++++++++ - Solutions/Other-CloudflareWorkers-How2use.md | 172 ++++++++++++++ - Solutions/Other-English-LearningNotes-SomeWords.md | 15 +- - Solutions/Other-Japanese-LearningNotes.md | 20 +- - api/img/handler.js | 23 ++ - api/img/url.js | 9 + - api/main.js | 37 +++ - .../.cache/wrangler/wrangler-account.json | 6 + - api/node_modules/.mf/cf.json | 1 + - api/wrangler.toml | 3 + - tryGoPy/temp-Count-uic.js | 31 +++ - 22 files changed, 998 insertions(+), 5 deletions(-) - create mode 100644 Codes/0935-knight-dialer.cpp - create mode 100644 Codes/0935-knight-dialer.go - create mode 100644 Codes/0935-knight-dialer.java - create mode 100644 Codes/0935-knight-dialer.py - create mode 100644 Codes/1812-determine-color-of-a-chessboard-square_20241209.cpp - create mode 100644 Codes/1812-determine-color-of-a-chessboard-square_20241209.go - create mode 100644 Codes/1812-determine-color-of-a-chessboard-square_20241209.java - create mode 100644 Codes/1812-determine-color-of-a-chessboard-square_20241209.py - create mode 100644 "Solutions/LeetCode 0935.\351\252\221\345\243\253\346\213\250\345\217\267\345\231\250.md" - create mode 100644 Solutions/Other-AI-FL-FederatedLearning-KaiTiBaoGao.md - create mode 100644 Solutions/Other-CloudflareWorkers-How2use.md - create mode 100644 api/img/handler.js - create mode 100644 api/img/url.js - create mode 100644 api/main.js - create mode 100644 api/node_modules/.cache/wrangler/wrangler-account.json - create mode 100644 api/node_modules/.mf/cf.json - create mode 100644 api/wrangler.toml - create mode 100644 tryGoPy/temp-Count-uic.js - - -PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git pull origin master -remote: Enumerating objects: 18, done. -remote: Counting objects: 100% (18/18), done. -remote: Compressing objects: 100% (10/10), done. -remote: Total 18 (delta 5), reused 18 (delta 5), pack-reused 0 (from 0) -Unpacking objects: 100% (18/18), 4.65 KiB | 3.00 KiB/s, done. -From ssh.github.com:LetMeFly666/LeetCode - * branch master -> FETCH_HEAD - 9392e7b5778..5416d7f90ab master -> origin/master -Updating 9392e7b5778..5416d7f90ab -Fast-forward - Solutions/Other-CloudflareWorkers-How2use.md | 68 ++++++++++++++++++++++++++++ - api/.gitignore | 1 + - api/github/public/README.md | 21 +++++++++ - api/github/public/demo.html | 15 ++++++ - api/github/public/handler.js | 26 +++++++++++ - api/github/public/url.js | 5 ++ - api/github/public/utils/calculateWidth.js | 17 +++++++ - api/img/handler.js | 6 +++ - api/img/url.js | 6 +++ - api/main.js | 9 ++-- - 10 files changed, 171 insertions(+), 3 deletions(-) - create mode 100644 api/.gitignore - create mode 100644 api/github/public/README.md - create mode 100644 api/github/public/demo.html - create mode 100644 api/github/public/handler.js - create mode 100644 api/github/public/url.js - create mode 100644 api/github/public/utils/calculateWidth.js \ No newline at end of file diff --git "a/tryGoPy/temp-20241206-\345\233\236\345\233\275\345\220\216-\350\207\252\345\212\250\350\204\232\346\234\254\347\232\204output.md" "b/tryGoPy/temp-20241206-\345\233\236\345\233\275\345\220\216-\350\207\252\345\212\250\350\204\232\346\234\254\347\232\204output.md" deleted file mode 100644 index b837c574234c..000000000000 --- "a/tryGoPy/temp-20241206-\345\233\236\345\233\275\345\220\216-\350\207\252\345\212\250\350\204\232\346\234\254\347\232\204output.md" +++ /dev/null @@ -1,81 +0,0 @@ - -... - -## What's more - -[本人](https://github.com/LetMeFly666)保留所有权，禁爬虫🚫 - -[999 7d598c78dc3] update: 添加问题“999.可以被一步捕获的棋子数”的代码和题解 - 6 files changed, 295 insertions(+), 1 deletion(-) - create mode 100644 Codes/0999-available-captures-for-rook.cpp - create mode 100644 "Solutions/LeetCode 0999.\345\217\257\344\273\245\350\242\253\344\270\200\346\255\245\346\215\225\350\216\267\347\232\204\346\243\213\345\255\220\346\225\260.md" - create mode 100644 "tryGoPy/temp-20241206-\345\233\236\345\233\275\345\220\216.md" - create mode 100644 tryGoPy/tttemp-gitdir-varous-pulllog.txt -Enumerating objects: 17, done. -Counting objects: 100% (17/17), done. -Delta compression using up to 8 threads -Compressing objects: 100% (11/11), done. -Writing objects: 100% (11/11), 5.63 KiB | 1.41 MiB/s, done. -Total 11 (delta 6), reused 0 (delta 0), pack-reused 0 -remote: Resolving deltas: 100% (6/6), completed with 6 local objects. -remote: -remote: Create a pull request for '999' on GitHub by visiting: -remote: https://github.com/LetMeFly666/LeetCode/pull/new/999 -remote: -To ssh.github.com:LetMeFly666/LeetCode - * [new branch] 999 -> 999 -Branch '999' set up to track remote branch '999' from 'origin'. -https://github.com/LetMeFly666/LeetCode/pull/643 - -✓ Merged pull request #643 (添加问题“999.可以被一步捕获的棋子数”的代码和题解) -remote: Enumerating objects: 1, done. -remote: Counting objects: 100% (1/1), done. -remote: Total 1 (delta 0), reused 0 (delta 0), pack-reused 0 (from 0) -Unpacking objects: 100% (1/1), 998 bytes | 22.00 KiB/s, done. -From ssh.github.com:LetMeFly666/LeetCode - * branch master -> FETCH_HEAD - d4a62f0e38f..cd0c22da603 master -> origin/master -Updating d4a62f0e38f..cd0c22da603 -Fast-forward - Codes/0999-available-captures-for-rook.cpp | 83 +++++++++++++++ - README.md | 1 + - ...232\204\346\243\213\345\255\220\346\225\260.md" | 118 +++++++++++++++++++++ - Solutions/Other-Japanese-LearningNotes.md | 9 +- - ...241206-\345\233\236\345\233\275\345\220\216.md" | 53 +++++++++ - tryGoPy/tttemp-gitdir-varous-pulllog.txt | 32 ++++++ - 6 files changed, 295 insertions(+), 1 deletion(-) - create mode 100644 Codes/0999-available-captures-for-rook.cpp - create mode 100644 "Solutions/LeetCode 0999.\345\217\257\344\273\245\350\242\253\344\270\200\346\255\245\346\215\225\350\216\267\347\232\204\346\243\213\345\255\220\346\225\260.md" - create mode 100644 "tryGoPy/temp-20241206-\345\233\236\345\233\275\345\220\216.md" - create mode 100644 tryGoPy/tttemp-gitdir-varous-pulllog.txt -✓ Deleted branch 999 and switched to branch master -remote: Enumerating objects: 12, done. -remote: Counting objects: 100% (12/12), done. -remote: Compressing objects: 100% (8/8), done. -Uremote: Total 12 (delta 4), reused 12 (delta 4), pack-reused 0 (from 0)npacking objects: 33% (4/12) -Unpacking objects: 100% (12/12), 12.90 KiB | 30.00 KiB/s, done. -From gitcode.com:Tisfy/gitcode_knowledge - 8b63ee7..028cfa8 main -> origin/main -Updating 8b63ee7..028cfa8 -Fast-forward - ...243\213\345\255\220\346\225\260\346\250\241\346\213\237-144303138.md" | 1 + - ...72\244\346\233\277\347\273\204I\351\201\215\345\216\206-144071026.md" | 1 + - ...3\204II\346\273\221\345\212\250\347\252\227\345\217\243-144123453.md" | 1 + - 3 files changed, 3 insertions(+) - create mode 100644 "CSDN\345\215\232\346\226\207\345\244\207\344\273\275/LeetCode0999.\345\217\257\344\273\245\350\242\253\344\270\200\346\255\245\346\215\225\350\216\267\347\232\204\346\243\213\345\255\220\346\225\260\346\250\241\346\213\237-144303138.md" - create mode 100644 "CSDN\345\215\232\346\226\207\345\244\207\344\273\275/LeetCode3206.\344\272\244\346\233\277\347\273\204I\351\201\215\345\216\206-144071026.md" - create mode 100644 "CSDN\345\215\232\346\226\207\345\244\207\344\273\275/LeetCode3208.\344\272\244\346\233\277\347\273\204II\346\273\221\345\212\250\347\252\227\345\217\243-144123453.md" -Enumerating objects: 6, done. -Counting objects: 100% (6/6), done. -Delta compression using up to 8 threads -Compressing objects: 100% (4/4), done. -Writing objects: 100% (4/4), 3.57 KiB | 3.57 MiB/s, done. -Total 4 (delta 1), reused 0 (delta 0), pack-reused 0 -remote: Resolving deltas: 100% (1/1), completed with 1 local object. -To github.com:LetMeFly666/LeetCode.git - d1388b9..028cfa8 main -> From_GitCode_CSDN \ No newline at end of file