Merge pull request #643 from LetMeFly666/999

LetMeFly666 · web-flow · commit cd0c22da6034 · 2024-12-07T00:34:12.000+08:00
添加问题“999.可以被一步捕获的棋子数”的代码和题解
diff --git a/Codes/0999-available-captures-for-rook.cpp b/Codes/0999-available-captures-for-rook.cpp
@@ -0,0 +1,83 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-12-07 00:02:55
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2024-12-07 00:18:47
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+#ifdef FirstTry  // WA，只进行了一次break
+const int directions[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
+class Solution {
+public:
+    int numRookCaptures(vector<vector<char>>& board) {
+        int x, y;
+        for (x = 0; x < board.size(); x++) {
+            for (y = 0; y < board[0].size(); y++) {
+                if (board[x][y] == 'R') {
+                    break;
+                }
+            }
+        }
+        int ans = 0;
+        for (int d = 0; d < 4; d++) {
+            for (int step = 1; ; step++) {
+                int nx = x + directions[d][0] * step;
+                int ny = y + directions[d][1] * step;
+                if (nx < 0 || nx >= board.size() || ny < 0 || ny >= board[0].size() || board[nx][ny] == 'B') {
+                    break;
+                }
+                ans += board[nx][ny] == 'p';
+            }
+        }
+        return ans;
+    }
+};
+#else  // FirstTry
+// SecondTry
+const int directions[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
+class Solution {
+public:
+    int numRookCaptures(vector<vector<char>>& board) {
+        int x, y;
+        for (x = 0; x < board.size(); x++) {
+            for (y = 0; y < board[0].size(); y++) {
+                if (board[x][y] == 'R') {
+                    goto loop;
+                }
+            }
+        }
+        loop:;
+        int ans = 0;
+        for (int d = 0; d < 4; d++) {
+            for (int step = 1; ; step++) {
+                int nx = x + directions[d][0] * step;
+                int ny = y + directions[d][1] * step;
+                if (nx < 0 || nx >= board.size() || ny < 0 || ny >= board[0].size() || board[nx][ny] == 'B') {
+                    break;
+                }
+                if (board[nx][ny] == 'p') {
+                    ans++;
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+};
+#endif  // FirstTry
+
+#ifdef _WIN32
+// [[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
+int main() {
+    Solution sol;
+    string s;
+    while (cin >> s) {
+        vector<vector<char>> v = stringToVectorVectorC(s);
+        cout << sol.numRookCaptures(v) << endl;
+    }
+    return 0;
+}
+#endif
diff --git a/README.md b/README.md
@@ -320,6 +320,7 @@
 |0993.二叉树的堂兄弟节点|简单|<a href="https://leetcode.cn/problems/cousins-in-binary-tree/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/02/08/LeetCode%200993.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%A0%82%E5%85%84%E5%BC%9F%E8%8A%82%E7%82%B9/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/136078040" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/cousins-in-binary-tree/solutions/2635757/letmefly-993er-cha-shu-de-tang-xiong-di-eyvq6/" target="_blank">LeetCode题解</a>|
 |0994.腐烂的橘子|中等|<a href="https://leetcode.cn/problems/rotting-oranges/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/13/LeetCode%200994.%E8%85%90%E7%83%82%E7%9A%84%E6%A9%98%E5%AD%90/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/138802167" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/rotting-oranges/solutions/2776028/letmefly-994fu-lan-de-ju-zi-yan-du-you-x-45fu/" target="_blank">LeetCode题解</a>|
 |0997.找到小镇的法官|简单|<a href="https://leetcode.cn/problems/find-the-town-judge/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/09/22/LeetCode%200997.%E6%89%BE%E5%88%B0%E5%B0%8F%E9%95%87%E7%9A%84%E6%B3%95%E5%AE%98/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142446520" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-town-judge/solutions/2926743/letmefly-997zhao-dao-xiao-zhen-de-fa-gua-9e5w/" target="_blank">LeetCode题解</a>|
+|0999.可以被一步捕获的棋子数|简单|<a href="https://leetcode.cn/problems/available-captures-for-rook/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/07/LeetCode%200999.%E5%8F%AF%E4%BB%A5%E8%A2%AB%E4%B8%80%E6%AD%A5%E6%8D%95%E8%8E%B7%E7%9A%84%E6%A3%8B%E5%AD%90%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144303138" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/available-captures-for-rook/solutions/3012619/letmefly-999ke-yi-bei-yi-bu-bu-huo-de-qi-z7fw/" target="_blank">LeetCode题解</a>|
 |1003.检查替换后的词是否有效|中等|<a href="https://leetcode.cn/problems/check-if-word-is-valid-after-substitutions/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/05/03/LeetCode%201003.%E6%A3%80%E6%9F%A5%E6%9B%BF%E6%8D%A2%E5%90%8E%E7%9A%84%E8%AF%8D%E6%98%AF%E5%90%A6%E6%9C%89%E6%95%88/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/130470201" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/check-if-word-is-valid-after-substitutions/solutions/2254002/letmefly-1003jian-cha-ti-huan-hou-de-ci-we7vj/" target="_blank">LeetCode题解</a>|
 |1010.总持续时间可被60整除的歌曲|中等|<a href="https://leetcode.cn/problems/pairs-of-songs-with-total-durations-divisible-by-60/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/05/07/LeetCode%201010.%E6%80%BB%E6%8C%81%E7%BB%AD%E6%97%B6%E9%97%B4%E5%8F%AF%E8%A2%AB60%E6%95%B4%E9%99%A4%E7%9A%84%E6%AD%8C%E6%9B%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/130544996" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/pairs-of-songs-with-total-durations-divisible-by-60/solutions/2260413/letmefly-1010zong-chi-xu-shi-jian-ke-bei-c8di/" target="_blank">LeetCode题解</a>|
 |1021.删除最外层的括号|简单|<a href="https://leetcode.cn/problems/remove-outermost-parentheses/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/05/28/LeetCode%201021.%E5%88%A0%E9%99%A4%E6%9C%80%E5%A4%96%E5%B1%82%E7%9A%84%E6%8B%AC%E5%8F%B7" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125015777" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/remove-outermost-parentheses/solution/letmefly-1021shan-chu-zui-wai-ceng-de-gu-nyio/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 0999.可以被一步捕获的棋子数.md b/Solutions/LeetCode 0999.可以被一步捕获的棋子数.md
@@ -0,0 +1,118 @@
+---
+title: 999.可以被一步捕获的棋子数
+date: 2024-12-07 00:25:18
+tags: [题解, LeetCode, 简单, 数组, 矩阵, 模拟]
+---
+
+# 【LetMeFly】999.可以被一步捕获的棋子数：模拟
+
+力扣题目链接：[https://leetcode.cn/problems/available-captures-for-rook/](https://leetcode.cn/problems/available-captures-for-rook/)
+
+<p>给定一个&nbsp;<code>8 x 8</code> 的棋盘，<strong>只有一个</strong> 白色的车，用字符 <code>'R'</code> 表示。棋盘上还可能存在白色的象&nbsp;<code>'B'</code>&nbsp;以及黑色的卒&nbsp;<code>'p'</code>。空方块用字符 <code>'.'</code>&nbsp;表示。</p>
+
+<p>车可以按水平或竖直方向（上，下，左，右）移动任意个方格直到它遇到另一个棋子或棋盘的边界。如果它能够在一次移动中移动到棋子的方格，则能够 <strong>吃掉</strong> 棋子。</p>
+
+<p>注意：车不能穿过其它棋子，比如象和卒。这意味着如果有其它棋子挡住了路径，车就不能够吃掉棋子。</p>
+
+<p>返回白车将能 <strong>吃掉</strong> 的 <strong>卒的数量</strong>。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/23/1253_example_1_improved.PNG" style="height: 305px; width: 300px;" /></p>
+
+<pre>
+<strong>输入：</strong>[[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
+<strong>输出：</strong>3
+<strong>解释：
+</strong>在本例中，车能够吃掉所有的卒。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/23/1253_example_2_improved.PNG" style="height: 306px; width: 300px;" /></p>
+
+<pre>
+<strong>输入：</strong>[[".",".",".",".",".",".",".","."],[".","p","p","p","p","p",".","."],[".","p","p","B","p","p",".","."],[".","p","B","R","B","p",".","."],[".","p","p","B","p","p",".","."],[".","p","p","p","p","p",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
+<strong>输出：</strong>0
+<strong>解释：
+</strong>象阻止了车吃掉任何卒。
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/23/1253_example_3_improved.PNG" style="height: 305px; width: 300px;" /></p>
+
+<pre>
+<strong>输入：</strong>[[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","p",".",".",".","."],["p","p",".","R",".","p","B","."],[".",".",".",".",".",".",".","."],[".",".",".","B",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."]]
+<strong>输出：</strong>3
+<strong>解释： </strong>
+车可以吃掉位置 b5，d6 和 f5 的卒。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ol>
+	<li><code>board.length == 8</code></li>
+	<li><code>board[i].length == 8</code></li>
+	<li><code>board[i][j]</code> 可以是&nbsp;<code>'R'</code>，<code>'.'</code>，<code>'B'</code>&nbsp;或&nbsp;<code>'p'</code></li>
+	<li>只有一个格子上存在&nbsp;<code>board[i][j] == 'R'</code></li>
+</ol>
+
+
+    
+## 解题方法：模拟
+
+一共分为两步：
+
+1. 遍历棋盘，遇到字符`R`时停下，并记录下起点下标
+2. 从起点开始分别向上下左右四个方向遍历，遇到边界或者遇到`B`停止。同时，遍历时若遇到`p`，则答案数量加一并停止。
+
++ 时间复杂度$O(mn)$，其中棋盘大小为$m\times n$
++ 空间复杂度$O(1)$
+
+[我的一个评论](https://leetcode.cn/problems/available-captures-for-rook/solutions/170099/che-de-ke-yong-bu-huo-liang-by-leetcode-solution/comments/2438607)
+
+### AC代码
+
+#### C++
+
+```cpp
+const int directions[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
+class Solution {
+public:
+    int numRookCaptures(vector<vector<char>>& board) {
+        int x, y;
+        for (x = 0; x < board.size(); x++) {
+            for (y = 0; y < board[0].size(); y++) {
+                if (board[x][y] == 'R') {
+                    goto loop;
+                }
+            }
+        }
+        loop:;
+        int ans = 0;
+        for (int d = 0; d < 4; d++) {
+            for (int step = 1; ; step++) {
+                int nx = x + directions[d][0] * step;
+                int ny = y + directions[d][1] * step;
+                if (nx < 0 || nx >= board.size() || ny < 0 || ny >= board[0].size() || board[nx][ny] == 'B') {
+                    break;
+                }
+                if (board[nx][ny] == 'p') {
+                    ans++;
+                    break;
+                }
+            }
+        }
+        return ans;
+    }
+};
+```
+
+> 同步发文于CSDN和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2024/12/07/LeetCode%200999.%E5%8F%AF%E4%BB%A5%E8%A2%AB%E4%B8%80%E6%AD%A5%E6%8D%95%E8%8E%B7%E7%9A%84%E6%A3%8B%E5%AD%90%E6%95%B0/)哦~
+>
+> Tisfy：[https://letmefly.blog.csdn.net/article/details/144303138](https://letmefly.blog.csdn.net/article/details/144303138)
diff --git a/Solutions/Other-Japanese-LearningNotes.md b/Solutions/Other-Japanese-LearningNotes.md
@@ -167,6 +167,7 @@ xx型
 |します|做|
 |やって|做|
 |やり|做|
+|切り(きり)|切|
 |磨き(みがき)|刷|
 |使い(つかい)|使用|
 |乗り(のり)|乘坐|
@@ -317,6 +318,7 @@ xx型
 |寒い(さむい)|冷的|
 |狭い(せまい)|狭小的|
 |広い(ひろい)|(学校等)大的|
+|まるい|圆的|
 |危ない(あぶない)|危险的|
 |同じ(おなじ)|一样的|
 |ゆっくり|慢慢|
@@ -333,6 +335,8 @@ xx型
 |かぜ|风|
 |いす|椅子|
 |手紙(てがみ)|信|
+|紙(かみ)|纸|
+|カギ|钥匙|
 |本(ほん)|书|
 |ペン|笔|
 |本棚(ほんだな)|书架|
@@ -1080,7 +1084,10 @@ xx型
 |その<ruby>後<rt>go</rt></ruby>、映画館に行きました。<br/>那之后去了电影院。|
 |映画のチケットは<ruby>後<rt>ato</rt></ruby>。<br/>电影票之后再买。|
 |行き<font color="#ce82ff">たくない</font>です。<br/>不想去。<details><summary>(自己)想做某事</summary>想要对方做某事：动词<font color="#ce82ff">て</font>形加上<font color="#ce82ff">ほしい</font><br/>自己想要做某事：动词<font color="#ce82ff">ます</font>形加上<font color="#ce82ff">たい</font><br/>自己**不**想做某事：把<font color="#ce82ff">たい</font>换成<font color="#ce82ff">たくない</font></details>|
-|友たちと映画を見たり、公園へ行ったりします。<br/>和朋友看看电影，逛逛公园|
+|友たちと映画を見たり、公園へ行ったりします。<br/>和朋友看看电影，逛逛公园。|
+|紙を２<font color="#28bea0">枚</font>ください。<br/>请给我两张纸。|
+|そのお皿はまるいです。<br/>那个盘子是圆的。|
+|パンをナイフで切ってください。<br/>请用刀切面包。|
 
 [单词添加时间](https://github.com/LetMeFly666/LeetCode/blame/master/Solutions/Other-Japanese-LearningNotes.md)
 
diff --git a/tryGoPy/temp-20241206-回国后.md b/tryGoPy/temp-20241206-回国后.md
@@ -0,0 +1,53 @@
+<!--
+ * @Author: LetMeFly
+ * @Date: 2024-12-06 21:08:35
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2024-12-06 21:08:35
+-->
+PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git pull origin master
+remote: Enumerating objects: 27, done.
+remote: Counting objects: 100% (27/27), done.
+remote: Compressing objects: 100% (14/14), done.
+remote: Total 27 (delta 17), reused 21 (delta 13), pack-reused 0 (from 0)
+Unpacking objects: 100% (27/27), 10.49 KiB | 5.00 KiB/s, done.
+From ssh.github.com:LetMeFly666/LeetCode
+ * branch                    master     -> FETCH_HEAD
+   37a4490d3d6..d4a62f0e38f  master     -> origin/master
+Updating 37a4490d3d6..d4a62f0e38f
+Fast-forward
+ Codes/0743-network-delay-time_20241125-half.cpp    |  27 +++
+ Codes/3206-alternating-groups-i.cpp                |  22 +++
+ Codes/3206-alternating-groups-i.go                 |  16 ++
+ Codes/3206-alternating-groups-i.java               |  17 ++
+ Codes/3206-alternating-groups-i.py                 |  11 ++
+ Codes/3208-alternating-groups-ii.cpp               |  28 +++
+ Codes/3208-alternating-groups-ii.go                |  28 +++
+ Codes/3208-alternating-groups-ii.java              |  29 ++++
+ Codes/3208-alternating-groups-ii.py                |  17 ++
+ README.md                                          |   2 +
+ ... 3206.\344\272\244\346\233\277\347\273\204I.md" | 136 +++++++++++++++
+ ...3208.\344\272\244\346\233\277\347\273\204II.md" | 191 +++++++++++++++++++++
+ Solutions/Other-English-LearningNotes-SomeWords.md |  13 ++
+ tryGoPy/CHANGELOG.md                               | 111 ++++++++++++
+ 14 files changed, 648 insertions(+)
+ create mode 100644 Codes/0743-network-delay-time_20241125-half.cpp
+ create mode 100644 Codes/3206-alternating-groups-i.cpp
+ create mode 100644 Codes/3206-alternating-groups-i.go
+ create mode 100644 Codes/3206-alternating-groups-i.java
+ create mode 100644 Codes/3206-alternating-groups-i.py
+ create mode 100644 Codes/3208-alternating-groups-ii.cpp
+ create mode 100644 Codes/3208-alternating-groups-ii.go
+ create mode 100644 Codes/3208-alternating-groups-ii.java
+ create mode 100644 Codes/3208-alternating-groups-ii.py
+ create mode 100644 "Solutions/LeetCode 3206.\344\272\244\346\233\277\347\273\204I.md"
+ create mode 100644 "Solutions/LeetCode 3208.\344\272\244\346\233\277\347\273\204II.md"
+ create mode 100644 tryGoPy/CHANGELOG.md
+PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git log
+commit d4a62f0e38f370fc5dda840981a9ef131796fbe3 (HEAD -> master, origin/master)
+Merge: bce53fccbaf 9c352c989cf
+Author: LetMeFly <56995506+LetMeFly666@users.noreply.github.com>
+Date:   Thu Nov 28 23:50:30 2024 +0800
+
+    Merge pull request #641 from LetMeFly666/3208
+    
+    添加问题“3208.交替组II”的代码和题解
diff --git a/tryGoPy/tttemp-gitdir-varous-pulllog.txt b/tryGoPy/tttemp-gitdir-varous-pulllog.txt
@@ -0,0 +1,32 @@
+F:\OtherApps\Program\Git\Store\Store2_Web_Various\various>git pull
+remote: Enumerating objects: 23, done.
+remote: Counting objects: 100% (23/23), done.
+remote: Compressing objects: 100% (2/2), done.
+remote: Total 15 (delta 10), reused 15 (delta 10), pack-reused 0 (from 0)
+Unpacking objects: 100% (15/15), 1.61 KiB | 2.00 KiB/s, done.
+From github.com:LetMeFly666/various
+   865c2ac..e9f950b  dev        -> original/dev
+   865c2ac..e9f950b  master     -> original/master
+warning: It took 10.50 seconds to check forced updates. You can use
+'--no-show-forced-updates' or run 'git config fetch.showForcedUpdates false'
+ to avoid this check.
+
+error: Your local changes to the following files would be overwritten by merge:
+        ACM/LeetCode/index.html
+Please commit your changes or stash them before you merge.
+Aborting
+Updating 865c2ac..e9f950b
+
+F:\OtherApps\Program\Git\Store\Store2_Web_Various\various>git status
+On branch dev
+Your branch is behind 'original/dev' by 3 commits, and can be fast-forwarded.
+  (use "git pull" to update your local branch)
+
+nothing to commit, working tree clean
+F:\OtherApps\Program\Git\Store\Store2_Web_Various\various>git pull
+Updating 865c2ac..e9f950b
+Fast-forward
+ ACM/LeetCode/index.html | 8 ++++++--
+ 1 file changed, 6 insertions(+), 2 deletions(-)
+
+F:\OtherApps\Program\Git\Store\Store2_Web_Various\various>
