update: 添加问题“2561.重排水果”的代码和题解 (#1060)

* 2561: WA.cpp (#1059)

* 2561: RE.cpp (#1059) - 爆int了

* 2561: AC.cpp (#1059)

* 2561: WA.py (#1059)

* 2561: AC.py (#1059)

cpp - AC,37.63%,96.77%
py - AC,62.59%,60.43%

* word(2561): WA.go (#1059)

不要被trae的自动补全所干扰

* word(2561): RE.go (#1059)

Line 31: Char 25: undefined: abs (solution.go)

* 2561: AC.go+CE.java (#1059)

go - AC,36.54%,26.25%

Line 17: error: method merge in interface Map<K,V> cannot be applied to given types;
            timeDiffs.merge(1, Integer::sum);
                     ^
  required: Integer,Integer,BiFunction<? super Integer,? super Integer,? extends Integer>
  found:    int,Integer::sum
  reason: actual and formal argument lists differ in length
  where K,V are type-variables:
    K extends Object declared in interface Map
    V extends Object declared in interface Map
Line 17: error: incompatible types: Integer is not a functional interface
            timeDiffs.merge(1, Integer::sum);
                               ^
Line 21: error: method merge in interface Map<K,V> cannot be applied to given types;
            timeDiffs.merge(-1, Integer::sum);
                     ^
  required: Integer,Integer,BiFunction<? super Integer,? super Integer,? extends Integer>
  found:    int,Integer::sum
  reason: actual and formal argument lists differ in length
  where K,V are type-variables:
    K extends Object declared in interface Map
    V extends Object declared in interface Map
Line 21: error: incompatible types: Integer is not a functional interface
            timeDiffs.merge(-1, Integer::sum);
                                ^
Line 39: error: method sort in interface List<E> cannot be applied to given types;
        change.sort();
              ^
  required: Comparator<? super Integer>
  found:    no arguments
  reason: actual and formal argument lists differ in length
  where E is a type-variable:
    E extends Object declared in interface List
5 errors

* 2561: AC.java (#1059) - 小憩一会儿

java - AC,94.93%,97.21%

* 2561: CE.rust (#1059)

* 2561: CE.rust (#1059)

困了说明，也太不走心了

* 2561: AC.rust (#1059)

rust - AC,34.69%,63.27%

* update: 添加问题“2561.重排水果”的代码和题解 (#1060)

Signed-off-by: LetMeFly666 <[email protected]>

* typo: 哈哈 leetcode还干过这事儿呢 (#1059)

---------

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.vscode/launch.json

@@ -38,10 +38,10 @@
             "request": "launch",
             "program": "${fileDirname}/${fileBasenameNoExtension}",
             "args": [],
-            "stopAtEntry": false,
+            "stopAtEntry": true,
             "cwd": "${fileDirname}",
             "environment": [],
-            "externalConsole": false,
+            "externalConsole": true,
             "MIMode": "lldb",
             "preLaunchTask": "C/C++: clang++ 生成活动文件"
         }

AllProblems/2561.重排水果/2561.重排水果.md

@@ -42,7 +42,7 @@ tags: [题解, LeetCode, 困难, 贪心, 数组, 哈希表]
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>basket1.length == bakste2.length</code></li>
+	<li><code>basket1.length == bakste2.length</code></li> typo 哈哈 leetcode还干过这事儿呢 - 等下次执行脚本覆盖掉吧
 	<li><code>1 &lt;= basket1.length &lt;= 10<sup>5</sup></code></li>
 	<li><code>1 &lt;= basket1<sub>i</sub>,basket2<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
 </ul>

Codes/2561-rearranging-fruits.cpp

@@ -0,0 +1,71 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-03 22:53:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-03 23:46:56
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+/*
+假设要交换的有 3 4 30 40
+
+b1: [3, 30]
+b2: [4, 40]
+
+则min: 3+4
+
+*/
+typedef long long ll;
+class Solution {
+public:
+    long long minCost(vector<int>& basket1, vector<int>& basket2) {
+        unordered_map<int, int> diffTimes;
+        int m = INT_MAX;
+        for (int t : basket1) {
+            diffTimes[t]++;
+            m = min(m, t);
+        }
+        for (int t : basket2) {
+            diffTimes[t]--;
+            m = min(m, t);
+        }
+        vector<int> change;
+        for (auto [val, times] : diffTimes) {
+            if (!times) {
+                continue;
+            }
+            if (times % 2) {
+                return -1;
+            }
+            for (int i = 0; i < abs(times) / 2; i++) {
+                change.push_back(val);
+            }
+        }
+        sort(change.begin(), change.end());
+        ll ans = 0;
+        for (int i = 0; i < change.size() / 2; i++) {
+            ans += min(change[i], 2 * m);
+        }
+        return ans;
+    }
+};
+
+/*
+[4,2,2,2]
+[1,4,1,2]
+
+1
+*/
+#if defined(_WIN32) || defined(__APPLE__)
+int main() {
+    string s1, s2;
+    while (cin >> s1 >> s2) {
+        vector<int> v1 = stringToVector(s1), v2 = stringToVector(s2);
+        Solution sol;
+        cout << sol.minCost(v1, v2) << endl;
+    }
+    return 0;
+}
+#endif

Codes/2561-rearranging-fruits.go

@@ -0,0 +1,48 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-03 22:53:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-04 13:38:44
+ */
+package main
+
+import "sort"
+
+func abs2561(x int) int {
+    if x < 0 {
+        return -x
+    }
+    return x
+}
+
+func minCost(basket1 []int, basket2 []int) (ans int64) {
+    timeDiffs := map[int]int{}
+    m := 1000000000
+    for _, t := range basket1 {
+        timeDiffs[t]++
+        m = min(m, t)
+    }
+    for _, t := range basket2 {
+        timeDiffs[t]--
+        m = min(m, t)
+    }
+    
+    change := []int{}
+    for val, times := range timeDiffs {
+        if times == 0 {
+            continue
+        }
+        if times % 2 != 0 {
+            return -1
+        }
+        for range abs2561(times) / 2 {  // 刚发现go还有这种语法呢
+            change = append(change, val)
+        }
+    }
+
+    sort.Ints(change)
+    for i := 0; i < len(change) / 2; i++ {
+        ans += int64(min(2 * m, change[i]))
+    }
+    return
+}

Codes/2561-rearranging-fruits.java

@@ -0,0 +1,45 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-03 22:53:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-04 13:46:46
+ */
+import java.util.Map;
+import java.util.HashMap;
+import java.util.List;
+import java.util.ArrayList;
+
+class Solution {
+    public long minCost(int[] basket1, int[] basket2) {
+        int m = basket1[0];
+        Map<Integer, Integer> timeDiffs = new HashMap<>();
+        for (int t : basket1) {
+            timeDiffs.merge(t, 1, Integer::sum);
+            m = Math.min(m, t);
+        }
+        for (int t : basket2) {
+            timeDiffs.merge(t, -1, Integer::sum);
+            m = Math.min(m, t);
+        }
+
+        List<Integer> change = new ArrayList<>();
+        for (Map.Entry<Integer, Integer> entry : timeDiffs.entrySet()) {
+            if (entry.getValue() == 0) {
+                continue;
+            }
+            if (entry.getValue() % 2 != 0) {
+                return -1;
+            }
+            for (int i = 0; i < Math.abs(entry.getValue()) / 2; i++) {
+                change.add(entry.getKey());
+            }
+        }
+
+        long ans = 0;
+        change.sort(Integer::compareTo);
+        for (int i = 0; i < change.size() / 2; i++) {
+            ans += Math.min(2 * m, change.get(i));
+        }
+        return ans;
+    }
+}

Codes/2561-rearranging-fruits.py

@@ -0,0 +1,27 @@
+'''
+Author: LetMeFly
+Date: 2025-08-03 22:53:42
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-08-04 00:07:41
+'''
+from typing import List
+from collections import defaultdict
+
+class Solution:
+    def minCost(self, basket1: List[int], basket2: List[int]) -> int:
+        m = min(min(basket1), min(basket2))
+        diffTimes = defaultdict(int)
+        for t in basket1:
+            diffTimes[t] += 1
+        for t in basket2:
+            diffTimes[t] -= 1
+        change = []
+        for val, times in diffTimes.items():
+            if not times:
+                continue
+            if times % 2:
+                return -1
+            for _ in range(abs(times) // 2):
+                change.append(val)
+        change.sort()
+        return sum(min(m * 2, t) for t in change[:len(change) // 2])

Codes/2561-rearranging-fruits.rs

@@ -0,0 +1,39 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-03 22:53:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-04 23:06:33
+ */
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn min_cost(basket1: Vec<i32>, basket2: Vec<i32>) -> i64 {
+        let mut m: i32 = i32::MAX;
+        let mut timeDiffs = HashMap::new();
+        for &t in &basket1 {
+            *timeDiffs.entry(t).or_insert(0) += 1;
+            m = m.min(t);
+        }
+        for &t in &basket2 {
+            *timeDiffs.entry(t).or_insert(0) -= 1;
+            m = m.min(t);
+        }
+        
+        let mut change: Vec<i32> = vec![];
+        for (&val, &times) in timeDiffs.iter() {
+            if times % 2 != 0 {
+                return -1;
+            }
+            for _ in 0..((times as i32).abs() / 2) {
+                change.push(val);
+            }
+        }
+
+        change.sort_unstable();
+        let mut ans: i64 = 0;
+        for i in 0..(change.len() / 2) {
+            ans += i64::from(change[i].min(2 * m));
+        }
+        ans
+    }
+}

README.md

@@ -806,6 +806,7 @@
 |2555.两个线段获得的最多奖品|中等|<a href="https://leetcode.cn/problems/maximize-win-from-two-segments/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/09/11/LeetCode%202555.%E4%B8%A4%E4%B8%AA%E7%BA%BF%E6%AE%B5%E8%8E%B7%E5%BE%97%E7%9A%84%E6%9C%80%E5%A4%9A%E5%A5%96%E5%93%81/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142149662" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximize-win-from-two-segments/solutions/2913563/letmefly-2555liang-ge-xian-duan-huo-de-d-fq43/" target="_blank">LeetCode题解</a>|
 |2558.从数量最多的堆取走礼物|简单|<a href="https://leetcode.cn/problems/take-gifts-from-the-richest-pile/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/10/28/LeetCode%202558.%E4%BB%8E%E6%95%B0%E9%87%8F%E6%9C%80%E5%A4%9A%E7%9A%84%E5%A0%86%E5%8F%96%E8%B5%B0%E7%A4%BC%E7%89%A9/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134088006" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/take-gifts-from-the-richest-pile/solutions/2501756/letmefly-2558cong-shu-liang-zui-duo-de-d-amgs/" target="_blank">LeetCode题解</a>|
 |2559.统计范围内的元音字符串数|中等|<a href="https://leetcode.cn/problems/count-vowel-strings-in-ranges/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/06/02/LeetCode%202559.%E7%BB%9F%E8%AE%A1%E8%8C%83%E5%9B%B4%E5%86%85%E7%9A%84%E5%85%83%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131014779" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-vowel-strings-in-ranges/solutions/2294361/letmefly-2559tong-ji-fan-wei-nei-de-yuan-mq4f/" target="_blank">LeetCode题解</a>|
+|2561.重排水果|困难|<a href="https://leetcode.cn/problems/rearranging-fruits/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/08/03/LeetCode%202561.%E9%87%8D%E6%8E%92%E6%B0%B4%E6%9E%9C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/149917019" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/rearranging-fruits/solutions/3742677/letmefly-2561zhong-pai-shui-guo-tan-xin-zsfq3/" target="_blank">LeetCode题解</a>|
 |2562.找出数组的串联值|简单|<a href="https://leetcode.cn/problems/find-the-array-concatenation-value/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/10/12/LeetCode%202562.%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%B2%E8%81%94%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/133797249" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-array-concatenation-value/solutions/2479676/letmefly-2562zhao-chu-shu-zu-de-chuan-li-5atk/" target="_blank">LeetCode题解</a>|
 |2563.统计公平数对的数目|中等|<a href="https://leetcode.cn/problems/count-the-number-of-fair-pairs/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/19/LeetCode%202563.%E7%BB%9F%E8%AE%A1%E5%85%AC%E5%B9%B3%E6%95%B0%E5%AF%B9%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147354620" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-the-number-of-fair-pairs/solutions/3656121/letmefly-2563tong-ji-gong-ping-shu-dui-d-u9bf/" target="_blank">LeetCode题解</a>|
 |2575.找出字符串的可整除数组|中等|<a href="https://leetcode.cn/problems/find-the-divisibility-array-of-a-string/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/03/07/LeetCode%202575.%E6%89%BE%E5%87%BA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%8F%AF%E6%95%B4%E9%99%A4%E6%95%B0%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/136544808" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-divisibility-array-of-a-string/solutions/2673564/letmefly-2575zhao-chu-zi-fu-chuan-de-ke-rbnfy/" target="_blank">LeetCode题解</a>|