diff --git a/solution/0500-0599/0570.Managers with at Least 5 Direct Reports/README.md b/solution/0500-0599/0570.Managers with at Least 5 Direct Reports/README.md
index 9e124c0fa471d..cdc9d52debeb3 100644
--- a/solution/0500-0599/0570.Managers with at Least 5 Direct Reports/README.md
+++ b/solution/0500-0599/0570.Managers with at Least 5 Direct Reports/README.md
@@ -17,15 +17,15 @@
| department | varchar |
| managerId | int |
+-------------+---------+
-在 SQL 中，id 是该表的主键列。
-该表的每一行都表示雇员的名字、他们的部门和他们的经理的id。
+id 是此表的主键（具有唯一值的列）。
+该表的每一行表示雇员的名字、他们的部门和他们的经理的id。
如果managerId为空，则该员工没有经理。
没有员工会成为自己的管理者。
-查询至少有5名直接下属的经理 。
+编写一个解决方案，找出至少有五个直接下属的经理。
以 任意顺序 返回结果表。
@@ -41,7 +41,7 @@ Employee 表:
+-----+-------+------------+-----------+
| id | name | department | managerId |
+-----+-------+------------+-----------+
-| 101 | John | A | None |
+| 101 | John | A | Null |
| 102 | Dan | A | 101 |
| 103 | James | A | 101 |
| 104 | Amy | A | 101 |
diff --git a/solution/0500-0599/0570.Managers with at Least 5 Direct Reports/README_EN.md b/solution/0500-0599/0570.Managers with at Least 5 Direct Reports/README_EN.md
index d04e4aec04ae0..23cd07e5f4fa0 100644
--- a/solution/0500-0599/0570.Managers with at Least 5 Direct Reports/README_EN.md
+++ b/solution/0500-0599/0570.Managers with at Least 5 Direct Reports/README_EN.md
@@ -38,7 +38,7 @@ Employee table:
+-----+-------+------------+-----------+
| id | name | department | managerId |
+-----+-------+------------+-----------+
-| 101 | John | A | None |
+| 101 | John | A | null |
| 102 | Dan | A | 101 |
| 103 | James | A | 101 |
| 104 | Amy | A | 101 |
diff --git a/solution/0700-0799/0700.Search in a Binary Search Tree/README.md b/solution/0700-0799/0700.Search in a Binary Search Tree/README.md
index cadd3eba9c477..daeb1340c0767 100644
--- a/solution/0700-0799/0700.Search in a Binary Search Tree/README.md
+++ b/solution/0700-0799/0700.Search in a Binary Search Tree/README.md
@@ -33,7 +33,7 @@
提示：
- - 数中节点数在
[1, 5000] 范围内
+ - 树中节点数在
[1, 5000] 范围内
1 <= Node.val <= 107root 是二叉搜索树1 <= val <= 107
+
Constraints:
diff --git a/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/README.md b/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/README.md
index 5d713b2f29cd4..446a667f40759 100644
--- a/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/README.md
+++ b/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/README.md
@@ -14,7 +14,7 @@
示例 1：
-
+
输入： grid = [[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]], k = 1
@@ -26,7 +26,7 @@
示例 2：
-
+
输入：grid = [[0,1,1],[1,1,1],[1,0,0]], k = 1
diff --git a/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/images/1700710701-uPqkZe-img_v3_025f_0edd50fb-8a70-4a42-add0-f602caaad35g.jpg b/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/images/1700710701-uPqkZe-img_v3_025f_0edd50fb-8a70-4a42-add0-f602caaad35g.jpg
new file mode 100644
index 0000000000000..9c53d098ec85c
Binary files /dev/null and b/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/images/1700710701-uPqkZe-img_v3_025f_0edd50fb-8a70-4a42-add0-f602caaad35g.jpg differ
diff --git a/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/images/1700710956-kcxqcC-img_v3_025f_d55a658c-8f40-464b-800f-22ccd27cc9fg.jpg b/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/images/1700710956-kcxqcC-img_v3_025f_d55a658c-8f40-464b-800f-22ccd27cc9fg.jpg
new file mode 100644
index 0000000000000..0d10aadef6182
Binary files /dev/null and b/solution/1200-1299/1293.Shortest Path in a Grid with Obstacles Elimination/images/1700710956-kcxqcC-img_v3_025f_d55a658c-8f40-464b-800f-22ccd27cc9fg.jpg differ
diff --git a/solution/1700-1799/1759.Count Number of Homogenous Substrings/README.md b/solution/1700-1799/1759.Count Number of Homogenous Substrings/README.md
index ee22ec6f355dc..2ff1acd90832b 100644
--- a/solution/1700-1799/1759.Count Number of Homogenous Substrings/README.md
+++ b/solution/1700-1799/1759.Count Number of Homogenous Substrings/README.md
@@ -49,7 +49,7 @@
1 <= s.length <= 105s 由小写字符串组成s 由小写字符串组成。
## 解法
diff --git a/solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/README_EN.md b/solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/README_EN.md
index 3692d9dc329fa..45a12da337e3f 100644
--- a/solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/README_EN.md
+++ b/solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/README_EN.md
@@ -41,7 +41,7 @@ One possible way to satisfy the conditions is by doing the following:
1. Rearrange arr so it becomes [1,100,1000].
2. Decrease the value of the second element to 2.
3. Decrease the value of the third element to 3.
-Now arr = [1,2,3], which satisfies the conditions.
+Now arr = [1,2,3], which satisfies the conditions.
The largest element in arr is 3.
diff --git a/solution/2900-2999/2936.Number of Equal Numbers Blocks/README.md b/solution/2900-2999/2936.Number of Equal Numbers Blocks/README.md
index 7b9839afaea9d..df1fff58ee10b 100644
--- a/solution/2900-2999/2936.Number of Equal Numbers Blocks/README.md
+++ b/solution/2900-2999/2936.Number of Equal Numbers Blocks/README.md
@@ -1,4 +1,4 @@
-# [2936. Number of Equal Numbers Blocks](https://leetcode.cn/problems/number-of-equal-numbers-blocks)
+# [2936. 包含相等值数字块的数量](https://leetcode.cn/problems/number-of-equal-numbers-blocks)
[English Version](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README_EN.md)
@@ -6,61 +6,63 @@
-You are given a 0-indexed array of integers, nums. The following property holds for nums:
+给定一个整数数组 nums，其 下标从 0 开始。对于 nums，有以下性质：
- - All occurrences of a value are adjacent. In other words, if there are two indices
i < j such that nums[i] == nums[j], then for every index k that i < k < j, nums[k] == nums[i].
+ - 所有相同值的元素都是相邻的。换句话说，如果存在两个下标
i < j，使得 nums[i] == nums[j]，那么对于所有下标 k，满足 i < k < j，都有 nums[k] == nums[i]。
-Since nums is a very large array, you are given an instance of the class BigArray which has the following functions:
+由于 nums 是一个非常大的数组，这里提供了一个 BigArray 类的实例，该实例具有以下函数：
- int at(long long index): Returns the value of nums[i].void size(): Returns nums.length.int at(long long index): 返回 nums[i] 的值。void size(): 返回 nums.length。
-Let's partition the array into maximal blocks such that each block contains equal values. Return the number of these blocks.
+让我们把数组分成 最大 的块，使得每个块包含 相等的值。返回这些块的数量。
-Note that if you want to test your solution using a custom test, behavior for tests with nums.length > 10 is undefined.
+请注意，如果要使用自定义测试测试解决方案，对于 nums.length > 10 的测试行为是未定义的。
-Example 1:
+
+示例 1：
-Input: nums = [3,3,3,3,3]
-Output: 1
-Explanation: There is only one block here which is the whole array (because all numbers are equal) and that is: [3,3,3,3,3]. So the answer would be 1.
+输入：nums = [3,3,3,3,3]
+输出：1
+解释：这里只有一个块，即整个数组（因为所有数字都相等），即：[3,3,3,3,3]。因此答案是 1。
-Example 2:
+示例 2：
-Input: nums = [1,1,1,3,9,9,9,2,10,10]
-Output: 5
-Explanation: There are 5 blocks here:
-Block number 1: [1,1,1,3,9,9,9,2,10,10]
-Block number 2: [1,1,1,3,9,9,9,2,10,10]
-Block number 3: [1,1,1,3,9,9,9,2,10,10]
-Block number 4: [1,1,1,3,9,9,9,2,10,10]
-Block number 5: [1,1,1,3,9,9,9,2,10,10]
-So the answer would be 5.
-
-Example 3:
+输入：nums = [1,1,1,3,9,9,9,2,10,10]
+输出：5
+解释：这里有 5 个块：
+块号 1: [1,1,1,3,9,9,9,2,10,10]
+块号 2: [1,1,1,3,9,9,9,2,10,10]
+块号 3: [1,1,1,3,9,9,9,2,10,10]
+块号 4: [1,1,1,3,9,9,9,2,10,10]
+块号 5: [1,1,1,3,9,9,9,2,10,10]
+因此答案是 5。
+
+示例 3：
-Input: nums = [1,2,3,4,5,6,7]
-Output: 7
-Explanation: Since all numbers are distinct, there are 7 blocks here and each element representing one block. So the answer would be 7.
+输入：nums = [1,2,3,4,5,6,7]
+输出：7
+解释：由于所有数字都是不同的，这里有 7 个块，每个元素代表一个块。因此答案是 7。
-Constraints:
+
+提示：
1 <= nums.length <= 10151 <= nums[i] <= 109- The input is generated such that all equal values are adjacent.
- - The sum of the elements of
nums is at most 1015.
+ - 在生成的输入中所有相同值的元素是相邻的。
+ nums 的所有元素之和最多为 1015。
## 解法
diff --git a/solution/CONTEST_README.md b/solution/CONTEST_README.md
index 0afc694e835da..2584ee7329523 100644
--- a/solution/CONTEST_README.md
+++ b/solution/CONTEST_README.md
@@ -218,7 +218,7 @@
- [2780. 合法分割的最小下标](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README.md)
- [2781. 最长合法子字符串的长度](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README.md)
-#### 第 353 场周赛(2023-07-09 10:30, 90 分钟) 参赛人数 4112
+#### 第 353 场周赛(2023-07-09 10:30, 90 分钟) 参赛人数 4113
- [2769. 找出最大的可达成数字](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README.md)
- [2770. 达到末尾下标所需的最大跳跃次数](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README.md)
diff --git a/solution/README.md b/solution/README.md
index 0de085e77822c..2acb986c5fbc7 100644
--- a/solution/README.md
+++ b/solution/README.md
@@ -2946,11 +2946,11 @@
| 2933 | [高访问员工](/solution/2900-2999/2933.High-Access%20Employees/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 371 场周赛 |
| 2934 | [最大化数组末位元素的最少操作次数](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README.md) | `贪心`,`数组` | 中等 | 第 371 场周赛 |
| 2935 | [找出强数对的最大异或值 II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README.md) | `位运算`,`字典树`,`数组`,`哈希表`,`滑动窗口` | 困难 | 第 371 场周赛 |
-| 2936 | [包含相等值数字块的数量](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README.md) | | 中等 | 🔒 |
-| 2937 | [使三个字符串相等](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README.md) | | 简单 | 第 372 场周赛 |
-| 2938 | [区分黑球与白球](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README.md) | | 中等 | 第 372 场周赛 |
-| 2939 | [最大异或乘积](/solution/2900-2999/2939.Maximum%20Xor%20Product/README.md) | | 中等 | 第 372 场周赛 |
-| 2940 | [找到 Alice 和 Bob 可以相遇的建筑](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README.md) | | 困难 | 第 372 场周赛 |
+| 2936 | [包含相等值数字块的数量](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README.md) | `数组`,`二分查找`,`分治` | 中等 | 🔒 |
+| 2937 | [使三个字符串相等](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README.md) | `字符串` | 简单 | 第 372 场周赛 |
+| 2938 | [区分黑球与白球](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 372 场周赛 |
+| 2939 | [最大异或乘积](/solution/2900-2999/2939.Maximum%20Xor%20Product/README.md) | `贪心`,`位运算`,`数学` | 中等 | 第 372 场周赛 |
+| 2940 | [找到 Alice 和 Bob 可以相遇的建筑](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README.md) | `栈`,`树状数组`,`线段树`,`数组`,`二分查找`,`单调栈`,`堆（优先队列）` | 困难 | 第 372 场周赛 |
| 2941 | [Maximum GCD-Sum of a Subarray](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README.md) | | 困难 | 🔒 |
## 版权
diff --git a/solution/README_EN.md b/solution/README_EN.md
index 9a980b9210ad2..393de2152e374 100644
--- a/solution/README_EN.md
+++ b/solution/README_EN.md
@@ -2944,11 +2944,11 @@ Press Control + F(or Command + F on
| 2933 | [High-Access Employees](/solution/2900-2999/2933.High-Access%20Employees/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 371 |
| 2934 | [Minimum Operations to Maximize Last Elements in Arrays](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 371 |
| 2935 | [Maximum Strong Pair XOR II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`Sliding Window` | Hard | Weekly Contest 371 |
-| 2936 | [Number of Equal Numbers Blocks](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README_EN.md) | | Medium | 🔒 |
-| 2937 | [Make Three Strings Equal](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README_EN.md) | | Easy | Weekly Contest 372 |
-| 2938 | [Separate Black and White Balls](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README_EN.md) | | Medium | Weekly Contest 372 |
-| 2939 | [Maximum Xor Product](/solution/2900-2999/2939.Maximum%20Xor%20Product/README_EN.md) | | Medium | Weekly Contest 372 |
-| 2940 | [Find Building Where Alice and Bob Can Meet](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md) | | Hard | Weekly Contest 372 |
+| 2936 | [Number of Equal Numbers Blocks](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README_EN.md) | `Array`,`Binary Search`,`Divide and Conquer` | Medium | 🔒 |
+| 2937 | [Make Three Strings Equal](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README_EN.md) | `String` | Easy | Weekly Contest 372 |
+| 2938 | [Separate Black and White Balls](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 372 |
+| 2939 | [Maximum Xor Product](/solution/2900-2999/2939.Maximum%20Xor%20Product/README_EN.md) | `Greedy`,`Bit Manipulation`,`Math` | Medium | Weekly Contest 372 |
+| 2940 | [Find Building Where Alice and Bob Can Meet](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md) | `Stack`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 372 |
| 2941 | [Maximum GCD-Sum of a Subarray](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README_EN.md) | | Hard | 🔒 |
## Copyright
diff --git a/solution/main.py b/solution/main.py
index 2bd612ecb78f6..4eab53b451077 100644
--- a/solution/main.py
+++ b/solution/main.py
@@ -360,14 +360,14 @@ def run():
if slug:
question_details[slug] = item
- for q in spider.get_all_questions(retry=4):
+ for q in spider.get_all_questions(retry=6):
slug = q["stat"]["question__title_slug"]
qid = q["stat"]["frontend_question_id"]
if slug in question_details:
continue
detail = spider.get_question_detail(
slug, retry=4
- ) or spider.get_question_detail_en(slug, retry=4)
+ ) or spider.get_question_detail_en(slug, retry=8)
if not detail:
continue
time.sleep(0.3)