Merge pull request #192 from LetMeFly666/2171

finished 2171

Author: LetMeFly666

Codes/2171-removing-minimum-number-of-magic-beans.cpp

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-01-18 19:20:51
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-01-18 19:32:10
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    long long minimumRemoval(vector<int>& beans) {
+        sort(beans.begin(), beans.end());
+        long long all = accumulate(beans.begin(), beans.end(), 0LL);
+        long long ans = all;
+        for (int i = 0; i < beans.size(); i++) {
+            ans = min(ans, all - ((long long)beans.size() - i) * beans[i]);
+        }
+        return ans;
+    }
+};

Codes/2171-removing-minimum-number-of-magic-beans.py

@@ -0,0 +1,16 @@
+'''
+Author: LetMeFly
+Date: 2024-01-18 19:32:37
+LastEditors: LetMeFly
+LastEditTime: 2024-01-18 19:35:01
+'''
+from typing import List
+
+class Solution:
+    def minimumRemoval(self, beans: List[int]) -> int:
+        beans.sort()
+        all_ = sum(beans)
+        ans = all_
+        for i, thisBean in enumerate(beans):
+            ans = min(ans, all_ - thisBean * (len(beans) - i))
+        return ans

README.md

@@ -428,6 +428,7 @@
 |2105.给植物浇水II|中等|<a href="https://leetcode.cn/problems/watering-plants-ii/" target="_blank">题目地址</a>|<a href="https://blog.tisfy.eu.org/2022/09/05/LeetCode%202105.%E7%BB%99%E6%A4%8D%E7%89%A9%E6%B5%87%E6%B0%B4II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126709258" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/watering-plants-ii/solution/by-tisfy-0erl/" target="_blank">LeetCode题解</a>|
 |2106.摘水果|困难|<a href="https://leetcode.cn/problems/maximum-fruits-harvested-after-at-most-k-steps/solutions/" target="_blank">题目地址</a>|<a href="https://blog.tisfy.eu.org/2023/05/04/LeetCode%202106.%E6%91%98%E6%B0%B4%E6%9E%9C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/130482457" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-fruits-harvested-after-at-most-k-steps/solutions/2255124/letmefly-2106zhai-shui-guo-by-tisfy-tb8v/" target="_blank">LeetCode题解</a>|
 |2132.用邮票贴满网格图|困难|<a href="https://leetcode.cn/problems/stamping-the-grid/solutions/" target="_blank">题目地址</a>|<a href="https://blog.tisfy.eu.org/2023/12/14/LeetCode%202132.%E7%94%A8%E9%82%AE%E7%A5%A8%E8%B4%B4%E6%BB%A1%E7%BD%91%E6%A0%BC%E5%9B%BE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135002925" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/stamping-the-grid/solutions/2566644/letmefly-2132yong-you-piao-tie-man-wang-znigh/" target="_blank">LeetCode题解</a>|
+|2171.拿出最少数目的魔法豆|中等|<a href="https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/solutions/" target="_blank">题目地址</a>|<a href="https://blog.tisfy.eu.org/2024/01/18/LeetCode%202171.%E6%8B%BF%E5%87%BA%E6%9C%80%E5%B0%91%E6%95%B0%E7%9B%AE%E7%9A%84%E9%AD%94%E6%B3%95%E8%B1%86/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135682601" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/solutions/2609831/letmefly-2171na-chu-zui-shao-shu-mu-de-m-jima/" target="_blank">LeetCode题解</a>|
 |2178.拆分成最多数目的正偶数之和|中等|<a href="https://leetcode.cn/problems/maximum-split-of-positive-even-integers/solutions/" target="_blank">题目地址</a>|<a href="https://blog.tisfy.eu.org/2023/07/06/LeetCode%202178.%E6%8B%86%E5%88%86%E6%88%90%E6%9C%80%E5%A4%9A%E6%95%B0%E7%9B%AE%E7%9A%84%E6%AD%A3%E5%81%B6%E6%95%B0%E4%B9%8B%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131567568" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-split-of-positive-even-integers/solutions/2332513/letmefly-2178chai-fen-cheng-zui-duo-shu-m44er/" target="_blank">LeetCode题解</a>|
 |2180.统计各位数字之和为偶数的整数个数|简单|<a href="https://leetcode.cn/problems/count-integers-with-even-digit-sum/solutions/" target="_blank">题目地址</a>|<a href="https://blog.tisfy.eu.org/2023/01/06/LeetCode%202180.%E7%BB%9F%E8%AE%A1%E5%90%84%E4%BD%8D%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C%E4%B8%BA%E5%81%B6%E6%95%B0%E7%9A%84%E6%95%B4%E6%95%B0%E4%B8%AA%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/128583772" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-integers-with-even-digit-sum/solutions/2048274/letmefly-2180tong-ji-ge-wei-shu-zi-zhi-h-g2ib/" target="_blank">LeetCode题解</a>|
 |2208.将数组和减半的最少操作次数|中等|<a href="https://leetcode.cn/problems/minimum-operations-to-halve-array-sum/solutions/" target="_blank">题目地址</a>|<a href="https://blog.tisfy.eu.org/2023/07/25/LeetCode%202208.%E5%B0%86%E6%95%B0%E7%BB%84%E5%92%8C%E5%87%8F%E5%8D%8A%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/131908685" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-halve-array-sum/solutions/2357632/letmefly-2208jiang-shu-zu-he-jian-ban-de-5gl0/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 2171.拿出最少数目的魔法豆.md

@@ -0,0 +1,108 @@
+---
+title: 2171.拿出最少数目的魔法豆
+date: 2024-01-18 19:29:06
+tags: [题解, LeetCode, 中等, 数组, 前缀和, 排序]
+---
+
+# 【LetMeFly】2171.拿出最少数目的魔法豆：排序 + 枚举
+
+力扣题目链接：[https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/](https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/)
+
+<p>给你一个 <strong>正</strong>&nbsp;整数数组&nbsp;<code>beans</code>&nbsp;，其中每个整数表示一个袋子里装的魔法豆的数目。</p>
+
+<p>请你从每个袋子中&nbsp;<strong>拿出</strong>&nbsp;一些豆子（也可以<strong>&nbsp;不拿出</strong>），使得剩下的 <strong>非空</strong> 袋子中（即 <strong>至少</strong>&nbsp;还有 <strong>一颗</strong>&nbsp;魔法豆的袋子）魔法豆的数目&nbsp;<strong>相等</strong>&nbsp;。一旦魔法豆从袋子中取出，你不能将它放到任何其他的袋子中。</p>
+
+<p>请你返回你需要拿出魔法豆的 <strong>最少数目</strong>。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><b>输入：</b>beans = [4,<em><strong>1</strong></em>,6,5]
+<b>输出：</b>4
+<b>解释：</b>
+- 我们从有 1 个魔法豆的袋子中拿出 1 颗魔法豆。
+  剩下袋子中魔法豆的数目为：[4,<em><b>0</b></em>,6,5]
+- 然后我们从有 6 个魔法豆的袋子中拿出 2 个魔法豆。
+  剩下袋子中魔法豆的数目为：[4,0,<em><strong>4</strong></em>,5]
+- 然后我们从有 5 个魔法豆的袋子中拿出 1 个魔法豆。
+  剩下袋子中魔法豆的数目为：[4,0,4,<em><b>4</b></em>]
+总共拿出了 1 + 2 + 1 = 4 个魔法豆，剩下非空袋子中魔法豆的数目相等。
+没有比取出 4 个魔法豆更少的方案。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><b>输入：</b>beans = [<em><strong>2</strong></em>,10,<em><strong>3</strong></em>,<em><strong>2</strong></em>]
+<b>输出：</b>7
+<strong>解释：</strong>
+- 我们从有 2 个魔法豆的其中一个袋子中拿出 2 个魔法豆。
+  剩下袋子中魔法豆的数目为：[<em><strong>0</strong></em>,10,3,2]
+- 然后我们从另一个有 2 个魔法豆的袋子中拿出 2 个魔法豆。
+  剩下袋子中魔法豆的数目为：[0,10,3,<em><strong>0</strong></em>]
+- 然后我们从有 3 个魔法豆的袋子中拿出 3 个魔法豆。
+  剩下袋子中魔法豆的数目为：[0,10,<em><strong>0</strong></em>,0]
+总共拿出了 2 + 2 + 3 = 7 个魔法豆，剩下非空袋子中魔法豆的数目相等。
+没有比取出 7 个魔法豆更少的方案。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= beans.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= beans[i] &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+
+    
+## 方法一：排序 + 枚举
+
+二话不说先将豆子数量从小到大排个序。
+
+统计一下一共有多少个豆子（即为all）。
+
+遍历每个袋子中豆子的数量（假设当前豆子数量为bean），计算将小于bean的袋子移空、大于等于bean的袋子移为bean所需移除的豆子总数。
+
+返回所有总数中的最小值即为答案。
+
++ 时间复杂度$O(len(beans))$
++ 空间复杂度$O(len(beans))$
+
+### AC代码
+
+#### C++
+
+```cpp
+class Solution {
+public:
+    long long minimumRemoval(vector<int>& beans) {
+        sort(beans.begin(), beans.end());
+        long long all = accumulate(beans.begin(), beans.end(), 0LL);
+        long long ans = all;
+        for (int i = 0; i < beans.size(); i++) {
+            ans = min(ans, all - ((long long)beans.size() - i) * beans[i]);
+        }
+        return ans;
+    }
+};
+```
+
+#### Python
+
+```python
+# from typing import List
+
+class Solution:
+    def minimumRemoval(self, beans: List[int]) -> int:
+        beans.sort()
+        all_ = sum(beans)
+        ans = all_
+        for i, thisBean in enumerate(beans):
+            ans = min(ans, all_ - thisBean * (len(beans) - i))
+        return ans
+```
+
+> 同步发文于CSDN，原创不易，转载经作者同意后请附上[原文链接](https://blog.tisfy.eu.org/2024/01/18/LeetCode%202171.%E6%8B%BF%E5%87%BA%E6%9C%80%E5%B0%91%E6%95%B0%E7%9B%AE%E7%9A%84%E9%AD%94%E6%B3%95%E8%B1%86/)哦~
+> Tisfy：[https://letmefly.blog.csdn.net/article/details/135682601](https://letmefly.blog.csdn.net/article/details/135682601)