chore: update lc problems (doocs#1394)

yanglbme · web-flow · commit 841f131a9c04 · 2023-08-04T20:33:30.000+08:00
diff --git a/solution/2800-2899/2802.Find The K-th Lucky Number/README.md b/solution/2800-2899/2802.Find The K-th Lucky Number/README.md
@@ -1,42 +1,44 @@
-# [2802. Find The K-th Lucky Number](https://leetcode.cn/problems/find-the-k-th-lucky-number)
+# [2802. 找出第 K 个幸运数字](https://leetcode.cn/problems/find-the-k-th-lucky-number)
 
 [English Version](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README_EN.md)
 
 ## 题目描述
 
 <!-- 这里写题目描述 -->
 
-<p>We know that <code>4</code> and <code>7</code> are <strong>lucky</strong> digits. Also, a number is called <strong>lucky</strong>&nbsp;if it contains <strong>only</strong> lucky digits.</p>
+<p>我们知道 <code>4</code> 和 <code>7</code> 是 <strong>幸运</strong> 数字。同时，如果一个数字只包含幸运数字，那么它被称为幸运数字。</p>
 
-<p>You are given an integer <code>k</code>, return<em> the </em><code>k<sup>th</sup></code><em>&nbsp;lucky number represented as a <strong>string</strong>.</em></p>
+<p>给定一个整数 <code>k</code>，返回第 <code>k</code> 个幸运数字，并将其表示为一个 <strong>字符串</strong> 。</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+
+<p><strong class="example">示例 1：</strong></p>
 
 <pre>
-<strong>Input:</strong> k = 4
-<strong>Output:</strong> &quot;47&quot;
-<strong>Explanation:</strong> The first lucky number is 4, the second one is 7, the third one is 44 and the fourth one is 47.
+<strong>输入：</strong>k = 4
+<b>输出：</b>"47"
+<b>解释：</b>第一个幸运数字是 4，第二个是 7，第三个是 44，第四个是 47。
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <pre>
-<strong>Input:</strong> k = 10
-<strong>Output:</strong> &quot;477&quot;
-<strong>Explanation:</strong> Here are lucky numbers sorted in increasing order:
-4, 7, 44, 47, 74, 77, 444, 447, 474, 477. So the 10<sup>th</sup> lucky number is 477.</pre>
+<b>输入：</b>k = 10
+<b>输出：</b>"477"
+<b>解释：</b>按递增顺序列出的幸运数字为：
+4, 7, 44, 47, 74, 77, 444, 447, 474, 477。 因此第10个幸运数字是477。</pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong class="example">示例 3：</strong></p>
 
 <pre>
-<strong>Input:</strong> k = 1000
-<strong>Output:</strong> &quot;777747447&quot;
-<strong>Explanation:</strong> It can be shown that the 1000<sup>th</sup> lucky number is 777747447.
+<b>输入：</b>k = 1000
+<b>输出：</b>"777747447"
+<b>解释：</b>第 1000 个幸运数字是 777747447。
 </pre>
 
 <p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
+
+<p><strong>提示：</strong></p>
 
 <ul>
 	<li><code>1 &lt;= k &lt;= 10<sup>9</sup></code></li>
diff --git a/solution/2800-2899/2803.Factorial Generator/README.md b/solution/2800-2899/2803.Factorial Generator/README.md
@@ -1,24 +1,25 @@
-# [2803. Factorial Generator](https://leetcode.cn/problems/factorial-generator)
+# [2803. 阶乘生成器](https://leetcode.cn/problems/factorial-generator)
 
 [English Version](/solution/2800-2899/2803.Factorial%20Generator/README_EN.md)
 
 ## 题目描述
 
 <!-- 这里写题目描述 -->
 
-<p>Write a generator function that takes an integer <code>n</code> as an argument and returns a generator object which yields the <strong>factorial sequence</strong>.</p>
+<p>编写一个生成器函数，该函数以一个整数 <code>n</code> 作为参数，并返回一个生成器对象，该生成器对象可以生成 <strong>阶乘序列</strong> 。</p>
 
-<p>The&nbsp;<strong>factorial sequence</strong>&nbsp;is defined by the relation <code>n!&nbsp;= n *&nbsp;<span style="font-size: 13px;">(</span>n-1)&nbsp;* (n-2)&nbsp;*&nbsp;...&nbsp;* 2 * 1​​​.</code></p>
+<p><strong>阶乘序列</strong> 的定义如下：<code>n! = n * (n-1) * (n-2) * ... * 2 * 1</code>&nbsp;。</p>
 
-<p>The factorial of 0 is defined as 1.</p>
+<p>0 的阶乘被定义为 1。</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+
+<p><strong class="example">示例 1：</strong></p>
 
 <pre>
-<strong>Input:</strong> n = 5
-<strong>Output:</strong> [1,2,6,24,120]
-<strong>Explanation:</strong> 
+<b>输入：</b>n = 5
+<b>输出：</b>[1,2,6,24,120]
+<b>解释：</b>
 const gen = factorial(5)
 gen.next().value // 1
 gen.next().value // 2
@@ -27,29 +28,30 @@ gen.next().value // 24
 gen.next().value // 120
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <pre>
-<strong>Input:</strong> n = 2
-<strong>Output:</strong> [1,2]
-<strong>Explanation:</strong> 
+<b>输入：</b>n = 2
+<b>输出：</b>[1,2]
+<b>解释：</b>
 const gen = factorial(2) 
 gen.next().value // 1 
 gen.next().value // 2 
 </pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong class="example">示例 3：</strong></p>
 
 <pre>
-<strong>Input:</strong> n = 0
-<strong>Output:</strong> [1]
-<strong>Explanation:</strong> 
+<b>输入：</b>n = 0
+<b>输出：</b>[1]
+<b>解释：</b>
 const gen = factorial(0) 
 gen.next().value // 1 
 </pre>
 
 <p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
+
+<p><strong>提示：</strong></p>
 
 <ul>
 	<li><code>0 &lt;= n &lt;= 18</code></li>
diff --git a/solution/2800-2899/2804.Array Prototype ForEach/README.md b/solution/2800-2899/2804.Array Prototype ForEach/README.md
@@ -1,73 +1,75 @@
-# [2804. Array Prototype ForEach](https://leetcode.cn/problems/array-prototype-foreach)
+# [2804. 数组原型的 forEach 方法](https://leetcode.cn/problems/array-prototype-foreach)
 
 [English Version](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README_EN.md)
 
 ## 题目描述
 
 <!-- 这里写题目描述 -->
 
-<p>Write your version of method&nbsp;<code>forEach</code>&nbsp;that enhances all arrays such that you can call the&nbsp;<code>array.forEach(callback, context)</code>&nbsp;method on any array and it will execute <code>callback</code> on each element of the array.&nbsp;Method&nbsp;<code>forEach</code> should not return anything.</p>
+<p>编写一个数组方法 <code>forEach</code>，使其可以在任何数组上调用 <code>array.forEach(callback, context)</code> 方法，它将在数组的每个元素上执行回调函数。<code>forEach</code> 方法不应该返回任何内容。</p>
 
-<p><code>callback</code> accepts the following arguments:</p>
+<p>回调函数 <code>callback</code> 接受以下参数：</p>
 
 <ul>
-	<li><code>value</code> -&nbsp;represents the current element being processed in the array. It is the value of the element in the current iteration.</li>
-	<li><code>index</code> -&nbsp;represents the index of the current element being processed in the array.</li>
-	<li><code>array</code> -&nbsp;represents the array itself, allowing access to the entire array within the callback function.</li>
+	<li><code>value</code> - 表示数组中当前正在处理的元素的值。</li>
+	<li><code>index</code> - 表示数组中当前正在处理的元素的索引。</li>
+	<li><code>array</code> - 表示数组本身，在回调函数内部可以访问整个数组。</li>
 </ul>
 
-<p>The <code>context</code> is the object that should be passed as the function context parameter to the <code>callback</code> function, ensuring that the <code>this</code>&nbsp;keyword within the <code>callback</code> function refers to this <code>context</code> object.</p>
+<p>上下文 <code>context</code> 应该是作为函数上下文参数传递给回调函数的对象，确保回调函数内部的 <code>this</code> 关键字引用此上下文对象。</p>
 
-<p>Try to implement it without using the built-in array methods.</p>
+<p>尝试在不使用内置数组方法的情况下实现这个方法。</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+
+<p><b>示例 1：</b></p>
 
 <pre>
-<strong>Input:</strong> 
+<b>输入：</b>
 arr = [1,2,3], 
 callback = (val, i, arr) =&gt; arr[i] = val * 2, 
-context = {&quot;context&quot;:true}
-<strong>Output:</strong> [2,4,6]
-<strong>Explanation:</strong> 
+context = {"context":true}
+<b>输出：</b>[2,4,6]
+<b>解释：</b>
 arr.forEach(callback, context)&nbsp; 
 console.log(arr) // [2,4,6]
 
-The callback is executed on each element of the array.
+回调函数在数组的每个元素上执行。
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <pre>
-<strong>Input:</strong> 
+<b>输入：</b>
 arr = [true, true, false, false], 
 callback = (val, i, arr) =&gt; arr[i] = this, 
-context = {&quot;context&quot;: false}
-<strong>Output:</strong> [{&quot;context&quot;:false},{&quot;context&quot;:false},{&quot;context&quot;:false},{&quot;context&quot;:false}]
-<strong>Explanation:</strong> 
+context = {"context": false}
+<b>输出：</b>[{"context":false},{"context":false},{"context":false},{"context":false}]
+<b>解释：</b>
 arr.forEach(callback, context)&nbsp;
-console.log(arr) // [{&quot;context&quot;:false},{&quot;context&quot;:false},{&quot;context&quot;:false},{&quot;context&quot;:false}]
+console.log(arr) // [{"context":false},{"context":false},{"context":false},{"context":false}]
 
-The callback is executed on each element of the array with the right context.
+回调函数在数组的每个元素上以正确的上下文执行。
 </pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong class="example">示例 3：</strong></p>
 
 <pre>
-<strong>Input:</strong> 
+<b>输入：</b>
 arr = [true, true, false, false], 
 callback = (val, i, arr) =&gt; arr[i] = !val, 
-context = {&quot;context&quot;: 5}
-<strong>Output:</strong> [false,false,true,true]
+context = {"context": 5}
+<b>输出：</b>[false,false,true,true]
 </pre>
 
 <p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
+
+<p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>arr</code> is a valid JSON array</li>
-	<li><code>context</code> is a valid JSON object</li>
-	<li><code>fn</code> is a function</li>
+	<li><code>arr</code> 是一个有效的 JSON 数组</li>
+	<li><code>context</code> 是一个有效的 JSON 对象</li>
+	<li><code>fn</code>&nbsp;是一个函数</li>
 	<li><code>0 &lt;= arr.length &lt;= 10<sup>5</sup></code></li>
 </ul>
 
diff --git a/solution/2800-2899/2805.Custom Interval/README.md b/solution/2800-2899/2805.Custom Interval/README.md
@@ -1,26 +1,27 @@
-# [2805. Custom Interval](https://leetcode.cn/problems/custom-interval)
+# [2805. 自定义间隔](https://leetcode.cn/problems/custom-interval)
 
 [English Version](/solution/2800-2899/2805.Custom%20Interval/README_EN.md)
 
 ## 题目描述
 
 <!-- 这里写题目描述 -->
 
-<p><strong>Function&nbsp;</strong><code>customInterval</code></p>
+<p><strong>函数</strong>&nbsp;<code>customInterval</code></p>
 
-<p>Given a function <code>fn</code>, a number <code>delay</code> and a number <code>period</code>, return&nbsp;a number&nbsp;<code>id</code>. <code>customInterval</code>&nbsp;is a function that should execute the provided function <code>fn</code> at intervals based on a linear pattern defined by the formula <code>delay&nbsp;+ period&nbsp;* count</code>.&nbsp;The <code>count</code> in the formula&nbsp;represents the number of times the interval has been&nbsp;executed starting from an initial value of 0.</p>
+<p>给定一个函数 <code>fn</code>、一个数字 <code>delay</code> 和一个数字 <code>period</code>，返回一个数字 <code>id</code>。<code>customInterval</code> 是一个函数，它应该根据公式 <code>delay + period * count</code> 在间隔中执行提供的函数 <code>fn</code>，公式中的 <code>count</code> 表示从初始值 0 开始执行间隔的次数。</p>
 
-<p><strong>Function </strong><code>customClearInterval</code>&nbsp;</p>
+<p><strong>函数</strong> <code>customClearInterval</code></p>
 
-<p>Given the&nbsp;<code>id</code>. <code>id</code>&nbsp;is the&nbsp;returned value from&nbsp;the function&nbsp;<code>customInterval</code>. <code>customClearInterval</code>&nbsp;should stop executing&nbsp;provided function <code>fn</code> at intervals.</p>
+<p>给定 <code>id</code>。<code>id</code> 是从函数 <code>customInterval</code> 返回的值。<code>customClearInterval</code> 应该停止在间隔中执行提供的函数 <code>fn</code>。</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+
+<p><b>示例 1：</b></p>
 
 <pre>
-<strong>Input:</strong> delay = 50, period = 20, stopTime = 225
-<strong>Output:</strong> [50,120,210]
-<strong>Explanation:</strong> 
+<b>输入：</b>delay = 50, period = 20, stopTime = 225
+<b>输出：</b>[50,120,210]
+<b>解释：</b>
 const t = performance.now()&nbsp;&nbsp;
 const result = []
 &nbsp; &nbsp; &nbsp; &nbsp;&nbsp;
@@ -33,34 +34,35 @@ setTimeout(() =&gt; {
     customClearInterval(id)
 }, 225)
 
-50 + 20 * 0 = 50 // 50ms - 1st function call
-50 + 20&nbsp;* 1 = 70 // 50ms + 70ms = 120ms - 2nd function call
-50 + 20 * 2 = 90 // 50ms + 70ms + 90ms = 210ms - 3rd function call
+50 + 20 * 0 = 50 // 50ms - 第一个函数调用
+50 + 20&nbsp;* 1 = 70 // 50ms + 70ms = 120ms - 第二个函数调用
+50 + 20 * 2 = 90 // 50ms + 70ms + 90ms = 210ms - 第三个函数调用
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <pre>
-<strong>Input:</strong> delay = 20, period = 20, stopTime = 150
-<strong>Output:</strong> [20,60,120]
-<strong>Explanation:</strong> 
-20 + 20 * 0 = 20 // 20ms - 1st function call
-20 + 20&nbsp;* 1 = 40 // 20ms + 40ms = 60ms - 2nd function call
-20 + 20 * 2 = 60 // 20ms + 40ms + 60ms = 120ms - 3rd function call
+<b>输入：</b>delay = 20, period = 20, stopTime = 150
+<b>输出：</b>[20,60,120]
+<b>解释：</b>
+20 + 20 * 0 = 20 // 20ms - 第一个函数调用
+20 + 20&nbsp;* 1 = 40 // 20ms + 40ms = 60ms - 第二个函数调用
+20 + 20 * 2 = 60 // 20ms + 40ms + 60ms = 120ms - 第三个函数调用
 </pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong class="example">示例 3：</strong></p>
 
 <pre>
-<strong>Input:</strong> delay = 100, period = 200, stopTime = 500
-<strong>Output:</strong> [100,400]
-<strong>Explanation:</strong> 
-100 + 200 * 0 = 100 // 100ms - 1st function call
-100 + 200&nbsp;* 1 = 300 // 100ms + 300ms = 400ms - 2nd function call
+<b>输入：</b>delay = 100, period = 200, stopTime = 500
+<b>输出：</b>[100,400]
+<b>解释：</b>
+100 + 200 * 0 = 100 // 100ms - 第一个函数调用
+100 + 200&nbsp;* 1 = 300 // 100ms + 300ms = 400ms - 第二个函数调用
 </pre>
 
 <p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
+
+<p><strong>提示：</strong></p>
 
 <ul>
 	<li><code>20 &lt;= delay, period &lt;= 250</code></li>
diff --git a/solution/README.md b/solution/README.md
@@ -2812,10 +2812,10 @@
 |  2799  |  [统计完全子数组的数目](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README.md)  |  `数组`,`哈希表`,`滑动窗口`  |  中等  |  第 356 场周赛  |
 |  2800  |  [包含三个字符串的最短字符串](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README.md)  |  `贪心`,`字符串`,`枚举`  |  中等  |  第 356 场周赛  |
 |  2801  |  [统计范围内的步进数字数目](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md)  |  `字符串`,`动态规划`  |  困难  |  第 356 场周赛  |
-|  2802  |  [Find The K-th Lucky Number](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README.md)  |    |  中等  |  🔒  |
-|  2803  |  [Factorial Generator](/solution/2800-2899/2803.Factorial%20Generator/README.md)  |    |  简单  |  🔒  |
-|  2804  |  [Array Prototype ForEach](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md)  |    |  简单  |  🔒  |
-|  2805  |  [Custom Interval](/solution/2800-2899/2805.Custom%20Interval/README.md)  |    |  中等  |  🔒  |
+|  2802  |  [找出第 K 个幸运数字](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README.md)  |    |  中等  |  🔒  |
+|  2803  |  [阶乘生成器](/solution/2800-2899/2803.Factorial%20Generator/README.md)  |    |  简单  |  🔒  |
+|  2804  |  [数组原型的 forEach 方法](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md)  |    |  简单  |  🔒  |
+|  2805  |  [自定义间隔](/solution/2800-2899/2805.Custom%20Interval/README.md)  |    |  中等  |  🔒  |
 
 ## 版权
 
diff --git a/solution/summary.md b/solution/summary.md
@@ -2857,7 +2857,7 @@
 - 2800-2899
   - [2800.包含三个字符串的最短字符串](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README.md)
   - [2801.统计范围内的步进数字数目](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md)
-  - [2802.Find The K-th Lucky Number](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README.md)
-  - [2803.Factorial Generator](/solution/2800-2899/2803.Factorial%20Generator/README.md)
-  - [2804.Array Prototype ForEach](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md)
-  - [2805.Custom Interval](/solution/2800-2899/2805.Custom%20Interval/README.md)
+  - [2802.找出第 K 个幸运数字](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README.md)
+  - [2803.阶乘生成器](/solution/2800-2899/2803.Factorial%20Generator/README.md)
+  - [2804.数组原型的 forEach 方法](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md)
+  - [2805.自定义间隔](/solution/2800-2899/2805.Custom%20Interval/README.md)
