Merge pull request #950 from LetMeFly666/3362

update: 添加问题“3362.零数组变换III”的代码和题解(#950)

Author: LetMeFly666

Codes/3362-zero-array-transformation-iii.cpp

@@ -0,0 +1,33 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-23 23:35:45
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-23 23:45:02
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int maxRemoval(vector<int>& nums, vector<vector<int>>& queries) {
+        sort(queries.begin(), queries.end());
+        vector<int> diff(nums.size() + 1);
+        priority_queue<int> pq;
+        for (int in = 0, iq = 0, cnt = 0; in < nums.size(); in++) {
+            cnt += diff[in];
+            while (iq < queries.size() && queries[iq][0] <= in) {
+                pq.push(queries[iq++][1]);
+            }
+            while (cnt < nums[in] && pq.size() && pq.top() >= in) {
+                cnt++;
+                diff[pq.top() + 1]--;
+                pq.pop();
+            }
+            if (cnt < nums[in]) {
+                return -1;
+            }
+        }
+        return pq.size();
+    }
+};

Codes/3362-zero-array-transformation-iii.go

@@ -0,0 +1,42 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-23 23:35:45
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-24 00:22:47
+ */
+package main
+
+import (
+    "slices"
+    "container/heap"
+)
+
+func maxRemoval(nums []int, queries [][]int) int {
+    slices.SortFunc(queries, func(a, b []int) int {
+        return a[0] - b[0]
+    })
+    diff := make([]int, len(nums) + 1)
+    pq := &pq3362{}
+    for in, iq, cnt := 0, 0, 0; in < len(nums); in++ {
+        cnt += diff[in]
+        for iq < len(queries) && queries[iq][0] <= in {
+            heap.Push(pq, queries[iq][1])
+            iq++
+        }
+        for cnt < nums[in] && len(*pq) > 0 && (*pq)[0] >= in {
+            cnt++
+            diff[heap.Pop(pq).(int) + 1]--
+        }
+        if cnt < nums[in] {
+            return -1
+        }
+    }
+    return len(*pq)
+}
+
+type pq3362 []int
+func (pq *pq3362) Push(a any)         {(*pq) = append((*pq), a.(int))}
+func (pq pq3362)  Len() int           {return len(pq)}
+func (pq pq3362)  Less(i, j int) bool {return pq[i] > pq[j]}
+func (pq pq3362)  Swap(i, j int)      {pq[i], pq[j] = pq[j], pq[i]}
+func (pq *pq3362) Pop() any           {a := (*pq)[len(*pq)-1]; (*pq) = (*pq)[:len(*pq)-1]; return a}

Codes/3362-zero-array-transformation-iii.java

@@ -0,0 +1,30 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-23 23:35:45
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-23 23:57:57
+ */
+import java.util.Arrays;
+import java.util.PriorityQueue;
+
+class Solution {
+    public int maxRemoval(int[] nums, int[][] queries) {
+        Arrays.sort(queries, (a, b) -> a[0] - b[0]);
+        int[] diff = new int[nums.length + 1];
+        PriorityQueue<Integer> pq = new PriorityQueue<>((a, b) -> b - a);
+        for (int in = 0, iq = 0, cnt = 0; in < nums.length; in++) {
+            cnt += diff[in];
+            while (iq < queries.length && queries[iq][0] <= in) {
+                pq.add(queries[iq++][1]);
+            }
+            while (cnt < nums[in] && !pq.isEmpty() && pq.peek() >= in) {
+                cnt++;
+                diff[pq.poll() + 1]--;
+            }
+            if (cnt < nums[in]) {
+                return -1;
+            }
+        }
+        return pq.size();
+    }
+}

Codes/3362-zero-array-transformation-iii.py

@@ -0,0 +1,26 @@
+'''
+Author: LetMeFly
+Date: 2025-05-23 23:35:45
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-05-23 23:52:09
+'''
+from typing import List
+import heapq
+
+class Solution:
+    def maxRemoval(self, nums: List[int], queries: List[List[int]]) -> int:
+        queries.sort()
+        diff = [0] * (len(nums) + 1)
+        cnt = iq = 0
+        pq = []
+        for inum in range(len(nums)):
+            cnt += diff[inum]
+            while iq < len(queries) and queries[iq][0] <= inum:
+                heapq.heappush(pq, -queries[iq][1])
+                iq += 1
+            while cnt < nums[inum] and len(pq) and -pq[0] >= inum:
+                cnt += 1
+                diff[-heapq.heappop(pq) + 1] -= 1
+            if cnt < nums[inum]:
+                return -1
+        return len(pq)

Codes/3362-zero-array-transformation-iii_20250524.cpp

@@ -0,0 +1,33 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-24 16:04:04
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-24 16:06:59
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int maxRemoval(vector<int>& nums, vector<vector<int>>& queries) {
+        sort(queries.begin(), queries.end());
+        vector<int> diff(nums.size() + 1);
+        priority_queue<int> pq;
+        for (int in = 0, iq = 0, cnt = 0; in < nums.size(); in++) {
+            cnt += diff[in];
+            while (iq < queries.size() && queries[iq][0] == in) {
+                pq.push(queries[iq++][1]);
+            }
+            while (cnt < nums[in] && pq.size() && pq.top() >= in) {
+                cnt++;
+                diff[pq.top() + 1]--;
+                pq.pop();
+            }
+            if (cnt < nums[in]) {
+                return -1;
+            }
+        }
+        return pq.size();
+    }
+};

README.md

@@ -973,6 +973,7 @@
 |3342.到达最后一个房间的最少时间II|中等|<a href="https://leetcode.cn/problems/find-minimum-time-to-reach-last-room-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/09/LeetCode%203342.%E5%88%B0%E8%BE%BE%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E6%88%BF%E9%97%B4%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147835524" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-minimum-time-to-reach-last-room-ii/solutions/3672695/letmefly-3342dao-da-zui-hou-yi-ge-fang-j-qrh6/" target="_blank">LeetCode题解</a>|
 |3355.零数组变换I|中等|<a href="https://leetcode.cn/problems/zero-array-transformation-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/21/LeetCode%203355.%E9%9B%B6%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148126611" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/zero-array-transformation-i/solutions/3683113/letmefly-3355ling-shu-zu-bian-huan-ichai-njzr/" target="_blank">LeetCode题解</a>|
 |3356.零数组变换II|中等|<a href="https://leetcode.cn/problems/zero-array-transformation-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/22/LeetCode%203356.%E9%9B%B6%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148151470" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/zero-array-transformation-ii/solutions/3683924/letmefly-3356ling-shu-zu-bian-huan-iier-zrey9/" target="_blank">LeetCode题解</a>|
+|3362.零数组变换III|中等|<a href="https://leetcode.cn/problems/zero-array-transformation-iii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/24/LeetCode%203362.%E9%9B%B6%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2III/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148192450" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/zero-array-transformation-iii/solutions/3684942/letmefly-3362ling-shu-zu-bian-huan-iiita-qfve/" target="_blank">LeetCode题解</a>|
 |3375.使数组的值全部为K的最少操作次数|简单|<a href="https://leetcode.cn/problems/minimum-operations-to-make-array-values-equal-to-k/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/09/LeetCode%203375.%E4%BD%BF%E6%95%B0%E7%BB%84%E7%9A%84%E5%80%BC%E5%85%A8%E9%83%A8%E4%B8%BAK%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147104288" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-make-array-values-equal-to-k/solutions/3646138/letmefly-3375shi-shu-zu-de-zhi-quan-bu-w-i71e/" target="_blank">LeetCode题解</a>|
 |3392.统计符合条件长度为3的子数组数目|简单|<a href="https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/29/LeetCode%203392.%E7%BB%9F%E8%AE%A1%E7%AC%A6%E5%90%88%E6%9D%A1%E4%BB%B6%E9%95%BF%E5%BA%A6%E4%B8%BA3%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147603015" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/solutions/3665081/letmefly-3392tong-ji-fu-he-tiao-jian-cha-h935/" target="_blank">LeetCode题解</a>|
 |3396.使数组元素互不相同所需的最少操作次数|简单|<a href="https://leetcode.cn/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/08/LeetCode%203396.%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E4%BA%92%E4%B8%8D%E7%9B%B8%E5%90%8C%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147080178" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/solutions/3644951/letmefly-3396shi-shu-zu-yuan-su-hu-bu-xi-glg4/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 3337.字符串转换后的长度II.md

@@ -36,30 +36,30 @@ categories: [题解, LeetCode]
 	<li>
 	<p><strong>第一次转换 (t = 1)</strong></p>
 
-	<ul>
-		<li><code>'a'</code> 变为 <code>'b'</code> 因为 <code>nums[0] == 1</code></li>
-		<li><code>'b'</code> 变为 <code>'c'</code> 因为 <code>nums[1] == 1</code></li>
-		<li><code>'c'</code> 变为 <code>'d'</code> 因为 <code>nums[2] == 1</code></li>
-		<li><code>'y'</code> 变为 <code>'z'</code> 因为 <code>nums[24] == 1</code></li>
-		<li><code>'y'</code> 变为 <code>'z'</code> 因为 <code>nums[24] == 1</code></li>
-		<li>第一次转换后的字符串为: <code>"bcdzz"</code></li>
-	</ul>
-	</li>
-	<li>
-	<p><strong>第二次转换 (t = 2)</strong></p>
+<ul>
+    <li><code>'a'</code> 变为 <code>'b'</code> 因为 <code>nums[0] == 1</code></li>
+    <li><code>'b'</code> 变为 <code>'c'</code> 因为 <code>nums[1] == 1</code></li>
+    <li><code>'c'</code> 变为 <code>'d'</code> 因为 <code>nums[2] == 1</code></li>
+    <li><code>'y'</code> 变为 <code>'z'</code> 因为 <code>nums[24] == 1</code></li>
+    <li><code>'y'</code> 变为 <code>'z'</code> 因为 <code>nums[24] == 1</code></li>
+    <li>第一次转换后的字符串为: <code>"bcdzz"</code></li>
+</ul>
+</li>
+<li>
+<p><strong>第二次转换 (t = 2)</strong></p>
 
-	<ul>
-		<li><code>'b'</code> 变为 <code>'c'</code> 因为 <code>nums[1] == 1</code></li>
-		<li><code>'c'</code> 变为 <code>'d'</code> 因为 <code>nums[2] == 1</code></li>
-		<li><code>'d'</code> 变为 <code>'e'</code> 因为 <code>nums[3] == 1</code></li>
-		<li><code>'z'</code> 变为 <code>'ab'</code> 因为 <code>nums[25] == 2</code></li>
-		<li><code>'z'</code> 变为 <code>'ab'</code> 因为 <code>nums[25] == 2</code></li>
-		<li>第二次转换后的字符串为: <code>"cdeabab"</code></li>
-	</ul>
-	</li>
-	<li>
-	<p><strong>字符串最终长度：</strong> 字符串为 <code>"cdeabab"</code>，长度为 7 个字符。</p>
-	</li>
+<ul>
+    <li><code>'b'</code> 变为 <code>'c'</code> 因为 <code>nums[1] == 1</code></li>
+    <li><code>'c'</code> 变为 <code>'d'</code> 因为 <code>nums[2] == 1</code></li>
+    <li><code>'d'</code> 变为 <code>'e'</code> 因为 <code>nums[3] == 1</code></li>
+    <li><code>'z'</code> 变为 <code>'ab'</code> 因为 <code>nums[25] == 2</code></li>
+    <li><code>'z'</code> 变为 <code>'ab'</code> 因为 <code>nums[25] == 2</code></li>
+    <li>第二次转换后的字符串为: <code>"cdeabab"</code></li>
+</ul>
+</li>
+<li>
+<p><strong>字符串最终长度：</strong> 字符串为 <code>"cdeabab"</code>，长度为 7 个字符。</p>
+</li>
 </ul>
 </div>
 

Solutions/LeetCode 3356.零数组变换II.md

@@ -36,7 +36,6 @@ categories: [题解, LeetCode]
 
 <ul>
 	<li><strong>对于 i = 0（l = 0, r = 2, val = 1）：</strong>
-
 	<ul>
 		<li>在下标&nbsp;<code>[0, 1, 2]</code> 处分别减少 <code>[1, 0, 1]</code>。</li>
 		<li>数组将变为 <code>[1, 0, 1]</code>。</li>
@@ -62,7 +61,6 @@ categories: [题解, LeetCode]
 
 <ul>
 	<li><strong>对于 i = 0（l = 1, r = 3, val = 2）：</strong>
-
 	<ul>
 		<li>在下标&nbsp;<code>[1, 2, 3]</code> 处分别减少 <code>[2, 2, 1]</code>。</li>
 		<li>数组将变为 <code>[4, 1, 0, 0]</code>。</li>
@@ -92,7 +90,7 @@ categories: [题解, LeetCode]
 
 
 
-## 解题方法：xx
+## 解题方法：二分查找+差分数组
 
 首先请解决[3355.零数组变换 I](https://blog.letmefly.xyz/2025/05/21/LeetCode%203355.%E9%9B%B6%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2I/)。