feat: update lc problems

yanglbme · yanglbme · commit b4c99ed3d17c · 2026-03-25T17:43:55.000+08:00
diff --git a/solution/3500-3599/3548.Equal Sum Grid Partition II/images/lc.jpeg b/solution/3500-3599/3548.Equal Sum Grid Partition II/images/lc.jpeg
diff --git a/solution/3800-3899/3874.Valid Subarrays With Exactly One Peak/README.md b/solution/3800-3899/3874.Valid Subarrays With Exactly One Peak/README.md
@@ -2,86 +2,92 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3874.Valid%20Subarrays%20With%20Exactly%20One%20Peak/README.md
+tags:
+    - 数组
+    - 数学
 ---
 
 <!-- problem:start -->
 
-# [3874. Valid Subarrays With Exactly One Peak 🔒](https://leetcode.cn/problems/valid-subarrays-with-exactly-one-peak)
+# [3874. 具有恰好一个峰值的有效子数组 🔒](https://leetcode.cn/problems/valid-subarrays-with-exactly-one-peak)
 
 [English Version](/solution/3800-3899/3874.Valid%20Subarrays%20With%20Exactly%20One%20Peak/README_EN.md)
 
 ## 题目描述
 
 <!-- description:start -->
 
-<p>You are given an integer array <code>nums</code> of length <code>n</code> and an integer <code>k</code>.</p>
+<p>给定一个长度为&nbsp;<code>n</code>&nbsp;的整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code>。</p>
 
-<p>An index <code>i</code> is a <strong>peak</strong> if:</p>
+<p>下标&nbsp;<code>i</code> 是 <strong>峰值</strong> 的条件为：</p>
 
 <ul>
 	<li><code>0 &lt; i &lt; n - 1</code></li>
-	<li><code>nums[i] &gt; nums[i - 1]</code> and <code>nums[i] &gt; nums[i + 1]</code></li>
+	<li><code>nums[i] &gt; nums[i - 1]</code> 且&nbsp;<code>nums[i] &gt; nums[i + 1]</code></li>
 </ul>
 
-<p>A subarray <code>[l, r]</code> is <strong>valid</strong> if:</p>
+<p>一个子数组&nbsp;<code>[l, r]</code>&nbsp;是 <strong>有效 </strong>的条件是：</p>
 
 <ul>
-	<li>It contains <strong>exactly one</strong> peak at index <code>i</code> from <code>nums</code></li>
-	<li><code>i - l &lt;= k</code> and <code>r - i &lt;= k</code></li>
+	<li>它 <strong>恰好有一个</strong>&nbsp;<code>nums</code>&nbsp;中下标&nbsp;<code>i</code> 处的峰值</li>
+	<li><code>i - l &lt;= k</code> 且&nbsp;<code>r - i &lt;= k</code></li>
 </ul>
 
-<p>Return an integer denoting the number of <strong>valid subarrays</strong> in <code>nums</code>.</p>
-A <strong>subarray</strong> is a contiguous <b>non-empty</b> sequence of elements within an array.
+<p>返回一个整数，表示 <code>nums</code> 中 <strong>有效子数组</strong> 的数量。</p>
+<strong>子数组</strong> 是数组中的连续 <strong>非空</strong> 元素序列。
+
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+
+<p><strong class="example">示例 1：</strong></p>
 
 <div class="example-block">
-<p><strong>Input:</strong> <span class="example-io">nums = [1,3,2], k = 1</span></p>
+<p><span class="example-io"><b>输入：</b>nums = [1,3,2], k = 1</span></p>
 
-<p><strong>Output:</strong> <span class="example-io">4</span></p>
+<p><span class="example-io"><b>输出：</b>4</span></p>
 
-<p><strong>Explanation:</strong></p>
+<p><strong>解释：</strong></p>
 
 <ul>
-	<li>Index <code>i = 1</code> is a peak because <code>nums[1] = 3</code> is greater than <code>nums[0] = 1</code> and <code>nums[2] = 2</code>.</li>
-	<li>Any valid subarray must include index 1, and the distance from the peak to both ends of the subarray must not exceed <code>k = 1</code>.</li>
-	<li>The valid subarrays are <code>[3]</code>, <code>[1, 3]</code>, <code>[3, 2]</code>, and <code>[1, 3, 2]</code>, so the answer is 4.</li>
+	<li>下标 <code>i = 1</code>&nbsp;是一个峰值，因为 <code>nums[1] = 3</code> 大于 <code>nums[0] = 1</code> 和 <code>nums[2] = 2</code>。</li>
+	<li>任何有效的子数组必须包含下标&nbsp;1，且子数组两端到峰值的距离不得超过 <code>k = 1</code>。</li>
+	<li>有效的子数组是&nbsp;<code>[3]</code>，<code>[1, 3]</code>，<code>[3, 2]</code>&nbsp;和&nbsp;<code>[1, 3, 2]</code>，所以答案是 4。</li>
 </ul>
 </div>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <div class="example-block">
-<p><strong>Input:</strong> <span class="example-io">nums = [7,8,9], k = 2</span></p>
+<p><span class="example-io"><b>输入：</b>nums = [7,8,9], k = 2</span></p>
 
-<p><strong>Output:</strong> <span class="example-io">0</span></p>
+<p><span class="example-io"><b>输出：</b>0</span></p>
 
-<p><strong>Explanation:</strong></p>
+<p><strong>解释：</strong></p>
 
 <ul>
-	<li>There is no index <code>i</code> such that <code>nums[i]</code> is greater than both <code>nums[i - 1]</code> and <code>nums[i + 1]</code>.</li>
-	<li>Therefore, the array contains no peak. Thus, the number of valid subarrays is 0.</li>
+	<li>没有下标&nbsp;<code>i</code> 使得&nbsp;<code>nums[i]</code>&nbsp;同时比&nbsp;<code>nums[i - 1]</code> 和&nbsp;<code>nums[i + 1]</code>&nbsp;更大。</li>
+	<li>因此，该数组中没有峰值。所以，有效子数组的数量为 0。</li>
 </ul>
 </div>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong class="example">示例 3：</strong></p>
 
 <div class="example-block">
-<p><strong>Input:</strong> <span class="example-io">nums = [4,3,5,1], k = 2</span></p>
+<p><span class="example-io"><b>输入：</b>nums = [4,3,5,1], k = 2</span></p>
 
-<p><strong>Output:</strong> <span class="example-io">6</span></p>
+<p><span class="example-io"><b>输出：</b>6</span></p>
 
-<p><strong>Explanation:</strong></p>
+<p><strong>解释：</strong></p>
 
 <ul>
-	<li>Index <code>i = 2</code> is a peak because <code>nums[2] = 5</code> is greater than <code>nums[1] = 3</code> and <code>nums[3] = 1</code>.</li>
-	<li>Any valid subarray must contain this peak, and the distance from the peak to both ends of the subarray must not exceed <code>k = 2</code>.</li>
-	<li>The valid subarrays are <code>[5]</code>, <code>[3, 5]</code>, <code>[5, 1]</code>, <code>[3, 5, 1]</code>, <code>[4, 3, 5]</code>, and <code>[4, 3, 5, 1]</code>, so the answer is 6.</li>
+	<li>下标 <code>i = 2</code>&nbsp;是一个峰值，因为 <code>nums[2] = 5</code> 大于 <code>nums[1] = 3</code>&nbsp;和 <code>nums[3] = 1</code>。</li>
+	<li>任何有效的子数组都必须包含这个峰值，并且峰值到子数组两端的距离不得超过 <code>k = 2</code>。</li>
+	<li>合法子数组是&nbsp;<code>[5]</code>，<code>[3, 5]</code>，<code>[5, 1]</code>，<code>[3, 5, 1]</code>，<code>[4, 3, 5]</code>&nbsp;和&nbsp;<code>[4, 3, 5, 1]</code>，所以答案是 6。</li>
 </ul>
 </div>
 
 <p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
+
+<p><strong>提示：</strong></p>
 
 <ul>
 	<li><code>1 &lt;= n == nums.length &lt;= 10<sup>5</sup></code></li>
diff --git a/solution/3800-3899/3874.Valid Subarrays With Exactly One Peak/README_EN.md b/solution/3800-3899/3874.Valid Subarrays With Exactly One Peak/README_EN.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3874.Valid%20Subarrays%20With%20Exactly%20One%20Peak/README_EN.md
+tags:
+    - Array
+    - Math
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3875.Construct Uniform Parity Array I/README.md b/solution/3800-3899/3875.Construct Uniform Parity Array I/README.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3875.Construct%20Uniform%20Parity%20Array%20I/README.md
+tags:
+    - 数组
+    - 数学
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3875.Construct Uniform Parity Array I/README_EN.md b/solution/3800-3899/3875.Construct Uniform Parity Array I/README_EN.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3875.Construct%20Uniform%20Parity%20Array%20I/README_EN.md
+tags:
+    - Array
+    - Math
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3876.Construct Uniform Parity Array II/README.md b/solution/3800-3899/3876.Construct Uniform Parity Array II/README.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3876.Construct%20Uniform%20Parity%20Array%20II/README.md
+tags:
+    - 数组
+    - 数学
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3876.Construct Uniform Parity Array II/README_EN.md b/solution/3800-3899/3876.Construct Uniform Parity Array II/README_EN.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3876.Construct%20Uniform%20Parity%20Array%20II/README_EN.md
+tags:
+    - Array
+    - Math
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3877.Minimum Removals to Achieve Target XOR/README.md b/solution/3800-3899/3877.Minimum Removals to Achieve Target XOR/README.md
@@ -2,6 +2,10 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3877.Minimum%20Removals%20to%20Achieve%20Target%20XOR/README.md
+tags:
+    - 位运算
+    - 数组
+    - 动态规划
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3877.Minimum Removals to Achieve Target XOR/README_EN.md b/solution/3800-3899/3877.Minimum Removals to Achieve Target XOR/README_EN.md
@@ -2,6 +2,10 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3877.Minimum%20Removals%20to%20Achieve%20Target%20XOR/README_EN.md
+tags:
+    - Bit Manipulation
+    - Array
+    - Dynamic Programming
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3878.Count Good Subarrays/README.md b/solution/3800-3899/3878.Count Good Subarrays/README.md
@@ -2,6 +2,11 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3878.Count%20Good%20Subarrays/README.md
+tags:
+    - 栈
+    - 位运算
+    - 数组
+    - 单调栈
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3878.Count Good Subarrays/README_EN.md b/solution/3800-3899/3878.Count Good Subarrays/README_EN.md
@@ -2,6 +2,11 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3878.Count%20Good%20Subarrays/README_EN.md
+tags:
+    - Stack
+    - Bit Manipulation
+    - Array
+    - Monotonic Stack
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3879.Maximum Distinct Path Sum in a Binary Tree/README.md b/solution/3800-3899/3879.Maximum Distinct Path Sum in a Binary Tree/README.md
@@ -2,6 +2,11 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3879.Maximum%20Distinct%20Path%20Sum%20in%20a%20Binary%20Tree/README.md
+tags:
+    - 树
+    - 深度优先搜索
+    - 哈希表
+    - 二叉树
 ---
 
 <!-- problem:start -->
diff --git a/solution/3800-3899/3879.Maximum Distinct Path Sum in a Binary Tree/README_EN.md b/solution/3800-3899/3879.Maximum Distinct Path Sum in a Binary Tree/README_EN.md
@@ -2,6 +2,11 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3879.Maximum%20Distinct%20Path%20Sum%20in%20a%20Binary%20Tree/README_EN.md
+tags:
+    - Tree
+    - Depth-First Search
+    - Hash Table
+    - Binary Tree
 ---
 
 <!-- problem:start -->
diff --git a/solution/README.md b/solution/README.md
@@ -3884,12 +3884,12 @@
 |  3871  |  [统计范围内的逗号 II](/solution/3800-3899/3871.Count%20Commas%20in%20Range%20II/README.md)  |  `数学`  |  中等  |  第 493 场周赛  |
 |  3872  |  [替换最多一个元素后的最长等差子数组](/solution/3800-3899/3872.Longest%20Arithmetic%20Sequence%20After%20Changing%20At%20Most%20One%20Element/README.md)  |  `数组`,`枚举`  |  中等  |  第 493 场周赛  |
 |  3873  |  [添加一个点后可激活的最大点数](/solution/3800-3899/3873.Maximum%20Points%20Activated%20with%20One%20Addition/README.md)  |  `并查集`,`数组`,`哈希表`  |  困难  |  第 493 场周赛  |
-|  3874  |  [Valid Subarrays With Exactly One Peak](/solution/3800-3899/3874.Valid%20Subarrays%20With%20Exactly%20One%20Peak/README.md)  |    |  中等  |  🔒  |
-|  3875  |  [构造奇偶一致的数组 I](/solution/3800-3899/3875.Construct%20Uniform%20Parity%20Array%20I/README.md)  |    |  简单  |  第 494 场周赛  |
-|  3876  |  [构造奇偶一致的数组 II](/solution/3800-3899/3876.Construct%20Uniform%20Parity%20Array%20II/README.md)  |    |  中等  |  第 494 场周赛  |
-|  3877  |  [达到目标异或值的最少删除次数](/solution/3800-3899/3877.Minimum%20Removals%20to%20Achieve%20Target%20XOR/README.md)  |    |  中等  |  第 494 场周赛  |
-|  3878  |  [统计好子数组](/solution/3800-3899/3878.Count%20Good%20Subarrays/README.md)  |    |  困难  |  第 494 场周赛  |
-|  3879  |  [二叉树中的最大不同路径和](/solution/3800-3899/3879.Maximum%20Distinct%20Path%20Sum%20in%20a%20Binary%20Tree/README.md)  |    |  中等  |  🔒  |
+|  3874  |  [具有恰好一个峰值的有效子数组](/solution/3800-3899/3874.Valid%20Subarrays%20With%20Exactly%20One%20Peak/README.md)  |  `数组`,`数学`  |  中等  |  🔒  |
+|  3875  |  [构造奇偶一致的数组 I](/solution/3800-3899/3875.Construct%20Uniform%20Parity%20Array%20I/README.md)  |  `数组`,`数学`  |  简单  |  第 494 场周赛  |
+|  3876  |  [构造奇偶一致的数组 II](/solution/3800-3899/3876.Construct%20Uniform%20Parity%20Array%20II/README.md)  |  `数组`,`数学`  |  中等  |  第 494 场周赛  |
+|  3877  |  [达到目标异或值的最少删除次数](/solution/3800-3899/3877.Minimum%20Removals%20to%20Achieve%20Target%20XOR/README.md)  |  `位运算`,`数组`,`动态规划`  |  中等  |  第 494 场周赛  |
+|  3878  |  [统计好子数组](/solution/3800-3899/3878.Count%20Good%20Subarrays/README.md)  |  `栈`,`位运算`,`数组`,`单调栈`  |  困难  |  第 494 场周赛  |
+|  3879  |  [二叉树中的最大不同路径和](/solution/3800-3899/3879.Maximum%20Distinct%20Path%20Sum%20in%20a%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`,`哈希表`,`二叉树`  |  中等  |  🔒  |
 
 ## 版权
 
diff --git a/solution/README_EN.md b/solution/README_EN.md
@@ -3882,12 +3882,12 @@ Press <kbd>Control</kbd> + <kbd>F</kbd>(or <kbd>Command</kbd> + <kbd>F</kbd> on
 |  3871  |  [Count Commas in Range II](/solution/3800-3899/3871.Count%20Commas%20in%20Range%20II/README_EN.md)  |  `Math`  |  Medium  |  Weekly Contest 493  |
 |  3872  |  [Longest Arithmetic Sequence After Changing At Most One Element](/solution/3800-3899/3872.Longest%20Arithmetic%20Sequence%20After%20Changing%20At%20Most%20One%20Element/README_EN.md)  |  `Array`,`Enumeration`  |  Medium  |  Weekly Contest 493  |
 |  3873  |  [Maximum Points Activated with One Addition](/solution/3800-3899/3873.Maximum%20Points%20Activated%20with%20One%20Addition/README_EN.md)  |  `Union Find`,`Array`,`Hash Table`  |  Hard  |  Weekly Contest 493  |
-|  3874  |  [Valid Subarrays With Exactly One Peak](/solution/3800-3899/3874.Valid%20Subarrays%20With%20Exactly%20One%20Peak/README_EN.md)  |    |  Medium  |  🔒  |
-|  3875  |  [Construct Uniform Parity Array I](/solution/3800-3899/3875.Construct%20Uniform%20Parity%20Array%20I/README_EN.md)  |    |  Easy  |  Weekly Contest 494  |
-|  3876  |  [Construct Uniform Parity Array II](/solution/3800-3899/3876.Construct%20Uniform%20Parity%20Array%20II/README_EN.md)  |    |  Medium  |  Weekly Contest 494  |
-|  3877  |  [Minimum Removals to Achieve Target XOR](/solution/3800-3899/3877.Minimum%20Removals%20to%20Achieve%20Target%20XOR/README_EN.md)  |    |  Medium  |  Weekly Contest 494  |
-|  3878  |  [Count Good Subarrays](/solution/3800-3899/3878.Count%20Good%20Subarrays/README_EN.md)  |    |  Hard  |  Weekly Contest 494  |
-|  3879  |  [Maximum Distinct Path Sum in a Binary Tree](/solution/3800-3899/3879.Maximum%20Distinct%20Path%20Sum%20in%20a%20Binary%20Tree/README_EN.md)  |    |  Medium  |  🔒  |
+|  3874  |  [Valid Subarrays With Exactly One Peak](/solution/3800-3899/3874.Valid%20Subarrays%20With%20Exactly%20One%20Peak/README_EN.md)  |  `Array`,`Math`  |  Medium  |  🔒  |
+|  3875  |  [Construct Uniform Parity Array I](/solution/3800-3899/3875.Construct%20Uniform%20Parity%20Array%20I/README_EN.md)  |  `Array`,`Math`  |  Easy  |  Weekly Contest 494  |
+|  3876  |  [Construct Uniform Parity Array II](/solution/3800-3899/3876.Construct%20Uniform%20Parity%20Array%20II/README_EN.md)  |  `Array`,`Math`  |  Medium  |  Weekly Contest 494  |
+|  3877  |  [Minimum Removals to Achieve Target XOR](/solution/3800-3899/3877.Minimum%20Removals%20to%20Achieve%20Target%20XOR/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`  |  Medium  |  Weekly Contest 494  |
+|  3878  |  [Count Good Subarrays](/solution/3800-3899/3878.Count%20Good%20Subarrays/README_EN.md)  |  `Stack`,`Bit Manipulation`,`Array`,`Monotonic Stack`  |  Hard  |  Weekly Contest 494  |
+|  3879  |  [Maximum Distinct Path Sum in a Binary Tree](/solution/3800-3899/3879.Maximum%20Distinct%20Path%20Sum%20in%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |  🔒  |
 
 ## Copyright
 
diff --git a/solution/result.json b/solution/result.json
