update: 添加问题“2938.区分黑球与白球”的代码和题解

LetMeFly666 · LetMeFly666 · commit a65a526f549f · 2024-06-06T22:58:47.000+08:00
diff --git a/Codes/2938-separate-black-and-white-balls.cpp b/Codes/2938-separate-black-and-white-balls.cpp
@@ -0,0 +1,32 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-06 22:33:40
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-06 22:36:46
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+/*
+1010
+1001
+0101
+0011
+*/
+typedef long long ll;
+class Solution {
+public:
+    ll minimumSteps(string s) {
+        ll ans = 0, times = 0;
+        for (char c : s) {
+            if (c == '1') {
+                times++;
+            }
+            else {
+                ans += times;
+            }
+        }
+        return ans;
+    }
+};
diff --git a/Codes/2938-separate-black-and-white-balls.go b/Codes/2938-separate-black-and-white-balls.go
@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-06 22:44:04
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-06 22:44:22
+ */
+package main
+
+func minimumSteps(s string) int64 {
+    ans, times := int64(0), 0
+    for _, c := range s {
+        if c == '1' {
+            times++
+        } else {  // 必须和上一个大括号写在同一行
+            ans += int64(times)
+        }
+    }
+    return ans
+}
diff --git a/Codes/2938-separate-black-and-white-balls.java b/Codes/2938-separate-black-and-white-balls.java
@@ -0,0 +1,20 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-06 22:41:50
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-06 22:43:17
+ */
+class Solution {
+    public long minimumSteps(String s) {
+        long ans = 0, times = 0;
+        for (char c : s.toCharArray()) {
+            if (c == '1') {
+                times++;
+            }
+            else {
+                ans += times;
+            }
+        }
+        return ans;
+    }
+}
diff --git a/Codes/2938-separate-black-and-white-balls.py b/Codes/2938-separate-black-and-white-balls.py
@@ -0,0 +1,15 @@
+'''
+Author: LetMeFly
+Date: 2024-06-06 22:40:13
+LastEditors: LetMeFly
+LastEditTime: 2024-06-06 22:40:50
+'''
+class Solution:
+    def minimumSteps(self, s: str) -> int:
+        ans, times = 0, 0
+        for c in s:
+            if c == '1':
+                times += 1
+            else:
+                ans += times
+        return ans
diff --git a/Codes/3072-distribute-elements-into-two-arrays-ii.cpp b/Codes/3072-distribute-elements-into-two-arrays-ii.cpp
@@ -0,0 +1,72 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-05 13:24:58
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-05 13:56:36
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class MyTree {
+private:
+    vector<int> a;
+
+public:
+    MyTree(int n) : a(n + 1) {}
+
+    void add(int n) {
+        while (n < a.size()) {
+            a[n]++;
+            n += n & -n;
+        }
+    }
+
+    int get(int n) {
+        int ans = 0;
+        while (n > 0) {
+            ans += a[n];
+            n -= n & -n;
+        }
+        return ans;
+    }
+};
+
+class Solution {
+public:
+    vector<int> resultArray(vector<int>& nums) {
+        // 离散化
+        vector<int> sorted(nums);
+        sort(sorted.begin(), sorted.end());
+        int length = unique(sorted.begin(), sorted.end()) - sorted.begin();
+        unordered_map<int, int> ma;
+        for (int i = 0; i < length; i++) {
+            ma[sorted[i]] = i + 1;
+        }
+        // begin
+        MyTree treeA(length), treeB(length);
+        treeA.add(ma[nums[0]]), treeB.add(ma[nums[1]]);
+        vector<int> a = {nums[0]}, b = {nums[1]};
+        for (int i = 2; i < nums.size(); i++) {
+            int na = a.size() - treeA.get(ma[nums[i]]), nb = b.size() - treeB.get(ma[nums[i]]);
+            if (na > nb) {
+                a.push_back(nums[i]);
+                treeA.add(ma[nums[i]]);
+            }
+            else if (na < nb) {
+                b.push_back(nums[i]);
+                treeB.add(ma[nums[i]]);
+            }
+            else if (a.size() > b.size()) {
+                b.push_back(nums[i]);
+                treeB.add(ma[nums[i]]);
+            }
+            else {
+                a.push_back(nums[i]);
+                treeA.add(ma[nums[i]]);
+            }
+        }
+        a.insert(a.end(), b.begin(), b.end());
+        return a;
+    }
+};
diff --git a/README.md b/README.md
@@ -617,6 +617,7 @@
 |2923.找到冠军I|简单|<a href="https://leetcode.cn/problems/find-champion-i/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/04/12/LeetCode%202923.%E6%89%BE%E5%88%B0%E5%86%A0%E5%86%9BI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/137678593" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-champion-i/solutions/2736315/letmefly-2923zhao-dao-guan-jun-ion2he-on-jrxw/" target="_blank">LeetCode题解</a>|
 |2924.找到冠军II|中等|<a href="https://leetcode.cn/problems/find-champion-ii/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/04/13/LeetCode%202924.%E6%89%BE%E5%88%B0%E5%86%A0%E5%86%9BII/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/137707389" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-champion-ii/solutions/2737408/letmefly-2924zhao-dao-guan-jun-iinao-jin-miks/" target="_blank">LeetCode题解</a>|
 |2928.给小朋友们分糖果I|简单|<a href="https://leetcode.cn/problems/distribute-candies-among-children-i/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/01/LeetCode%202928.%E7%BB%99%E5%B0%8F%E6%9C%8B%E5%8F%8B%E4%BB%AC%E5%88%86%E7%B3%96%E6%9E%9CI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139380754" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/distribute-candies-among-children-i/solutions/2797856/letmefly-2928gei-xiao-peng-you-men-fen-t-u01r/" target="_blank">LeetCode题解</a>|
+|2938.区分黑球与白球|中等|<a href="https://leetcode.cn/problems/separate-black-and-white-balls/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/06/LeetCode%202938.%E5%8C%BA%E5%88%86%E9%BB%91%E7%90%83%E4%B8%8E%E7%99%BD%E7%90%83/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139511813" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/separate-black-and-white-balls/solutions/2803386/letmefly-2938qu-fen-hei-qiu-yu-bai-qiu-h-6w6y/" target="_blank">LeetCode题解</a>|
 |2951.找出峰值|简单|<a href="https://leetcode.cn/problems/find-the-peaks/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/28/LeetCode%202951.%E6%89%BE%E5%87%BA%E5%B3%B0%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139279605" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-peaks/solutions/2793708/letmefly-2951zhao-chu-feng-zhi-mo-ni-bia-5jn1/" target="_blank">LeetCode题解</a>|
 |2952.需要添加的硬币的最小数量|中等|<a href="https://leetcode.cn/problems/minimum-number-of-coins-to-be-added/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/03/30/LeetCode%202952.%E9%9C%80%E8%A6%81%E6%B7%BB%E5%8A%A0%E7%9A%84%E7%A1%AC%E5%B8%81%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E9%87%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/137185903" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-number-of-coins-to-be-added/solutions/2716158/letmefly-2952xu-yao-tian-jia-de-ying-bi-bxfa4/" target="_blank">LeetCode题解</a>|
 |2960.统计已测试设备|简单|<a href="https://leetcode.cn/problems/count-tested-devices-after-test-operations/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/10/LeetCode%202960.%E7%BB%9F%E8%AE%A1%E5%B7%B2%E6%B5%8B%E8%AF%95%E8%AE%BE%E5%A4%87/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/138672383" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-tested-devices-after-test-operations/solutions/2772739/letmefly-2960tong-ji-yi-ce-shi-she-bei-k-59qt/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 2938.区分黑球与白球.md b/Solutions/LeetCode 2938.区分黑球与白球.md
@@ -0,0 +1,153 @@
+---
+title: 2938.区分黑球与白球
+date: 2024-06-06 22:51:23
+tags: [题解, LeetCode, 中等, 贪心, 双指针, 字符串]
+---
+
+# 【LetMeFly】2938.区分黑球与白球：黑球要与后面每个白球交换一次
+
+力扣题目链接：[https://leetcode.cn/problems/separate-black-and-white-balls/](https://leetcode.cn/problems/separate-black-and-white-balls/)
+
+<p>桌子上有 <code>n</code> 个球，每个球的颜色不是黑色，就是白色。</p>
+
+<p>给你一个长度为 <code>n</code> 、下标从 <strong>0</strong> 开始的二进制字符串 <code>s</code>，其中 <code>1</code> 和 <code>0</code> 分别代表黑色和白色的球。</p>
+
+<p>在每一步中，你可以选择两个相邻的球并交换它们。</p>
+
+<p>返回「将所有黑色球都移到右侧，所有白色球都移到左侧所需的 <strong>最小步数</strong>」。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "101"
+<strong>输出：</strong>1
+<strong>解释：</strong>我们可以按以下方式将所有黑色球移到右侧：
+- 交换 s[0] 和 s[1]，s = "011"。
+最开始，1 没有都在右侧，需要至少 1 步将其移到右侧。</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "100"
+<strong>输出：</strong>2
+<strong>解释：</strong>我们可以按以下方式将所有黑色球移到右侧：
+- 交换 s[0] 和 s[1]，s = "010"。
+- 交换 s[1] 和 s[2]，s = "001"。
+可以证明所需的最小步数为 2 。
+</pre>
+
+<p><strong class="example">示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "0111"
+<strong>输出：</strong>0
+<strong>解释：</strong>所有黑色球都已经在右侧。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n == s.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>s[i]</code> 不是 <code>'0'</code>，就是 <code>'1'</code>。</li>
+</ul>
+
+
+    
+## 解题方法：一次遍历
+
+同色球交换无意义，因此所有的交换都是：前面的黑球与黑球后面的白球。
+
+因此统计一下每个黑球后面有多少个白球即可。
+
+怎么统计？使用一个变量记录当前遍历到的黑球数，遇到一个黑球就黑球数加一，遇到一个白球答案就加上黑球数。
+
++ 时间复杂度$O(len(s))$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+1010
+1001
+0101
+0011
+*/
+typedef long long ll;
+class Solution {
+public:
+    ll minimumSteps(string s) {
+        ll ans = 0, times = 0;
+        for (char c : s) {
+            if (c == '1') {
+                times++;
+            }
+            else {
+                ans += times;
+            }
+        }
+        return ans;
+    }
+};
+```
+
+#### Go
+
+```go
+// package main
+
+func minimumSteps(s string) int64 {
+    ans, times := int64(0), 0
+    for _, c := range s {
+        if c == '1' {
+            times++
+        } else {  // 必须和上一个大括号写在同一行
+            ans += int64(times)
+        }
+    }
+    return ans
+}
+```
+
+#### Java
+
+```java
+class Solution {
+    public long minimumSteps(String s) {
+        long ans = 0, times = 0;
+        for (char c : s.toCharArray()) {
+            if (c == '1') {
+                times++;
+            }
+            else {
+                ans += times;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+#### Python
+
+```python
+class Solution:
+    def minimumSteps(self, s: str) -> int:
+        ans, times = 0, 0
+        for c in s:
+            if c == '1':
+                times += 1
+            else:
+                ans += times
+        return ans
+```
+
+> 同步发文于CSDN和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2024/06/06/LeetCode%202938.%E5%8C%BA%E5%88%86%E9%BB%91%E7%90%83%E4%B8%8E%E7%99%BD%E7%90%83/)哦~
+>
+> Tisfy：[https://letmefly.blog.csdn.net/article/details/139511813](https://letmefly.blog.csdn.net/article/details/139511813)
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -220,7 +220,7 @@ tags: [其他, 知识, 英语, Notes]
 |sink|v. (使)下沉，沉没，降低，挖，掘，把...埋入，使受挫，使陷入麻烦<br/>n. 洗碗槽，洗脸盆<details><summary>过去式</summary>sank</details>|
 |||
 |ambassador|b. 大使|
-|villa|n. 别墅，豪宅|
+|<font color="#28bea0" title="二次复习">villa</font>|n. 别墅，豪宅|
 |fig|n. 【植】无花果，【植】无花果树<br/>abbr. (=figure)图，图表|
 |||
 |rebate|n. 折扣，退还款<br/>v. 退还(部分付款)，扣除|
@@ -235,6 +235,17 @@ tags: [其他, 知识, 英语, Notes]
 |stencil|n. (印刷用)模板，(模板印的)文字<br/>v. 用模板印(文字/图案)|
 |pluck|v. 摘，拔(去)，拨(弦)，解救v. 胆识，胆量，内脏，快而猛的拉，勇气|
 |daybreak|n. 黎明，破晓|
+|||
+|adorn|v. 装饰，装扮|
+|||
+|reef|n. 礁，礁脉，帆的可收缩部<br/>v. 收帆，卷起缩帆部，叠起缩帆部|
+|weld|v. 焊接，熔接，使紧密结合<br/>n. 焊接点，焊接处|
+|hydrogen|n. 氢，氢气|
+|smash|n. 打碎，破碎(声)，走红的作品<br/>v. 打碎，猛撞，猛击，击溃，粉碎|
+|materialize|v. 实现，发生，成为现实，突然显现|
+|serene|adj. 平静的，宁静的，安详的<br/>v. 宁静，<诗>使(海,脸色等)平静，使(天空)明朗<br/>n. 平静(的海)，<诗,古>晴朗(天空)|
+|hazard|n. 危险，危害<br/>冒失地提出，冒险猜测，冒...的风险，使处于危险|
+
 
 <details>
 <summary>扇贝音频测试</summary>
diff --git a/Solutions/Other-Japanese-LearningNotes.md b/Solutions/Other-Japanese-LearningNotes.md
