Merge pull request #413 from LetMeFly666/575

LetMeFly666 · web-flow · commit 59413f5e1c2c · 2024-06-02T10:14:44.000+08:00
添加问题“575.分糖果”的代码和题解
diff --git a/Codes/0575-distribute-candies_20240602.cpp b/Codes/0575-distribute-candies_20240602.cpp
@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-02 09:38:52
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-02 09:40:13
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int distributeCandies(vector<int>& candyType) {
+        set<int> se(candyType.begin(), candyType.end());
+        return min(se.size(), candyType.size() / 2);
+    }
+};
diff --git a/Codes/0575-distribute-candies_20240602.go b/Codes/0575-distribute-candies_20240602.go
@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-02 09:45:36
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-02 09:57:46
+ */
+package main
+
+func min(a int, b int) int {
+    if a <= b {
+        return a
+    }
+    return b
+}
+
+func distributeCandies(candyType []int) int {
+    se := make(map[int]int)
+    for _, t := range candyType {
+        se[t] = 0
+    }
+    return min(len(se), len(candyType) / 2)
+}
diff --git a/Codes/0575-distribute-candies_20240602.java b/Codes/0575-distribute-candies_20240602.java
@@ -0,0 +1,18 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-02 09:41:57
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-02 09:44:00
+ */
+import java.util.HashSet;
+import java.util.Set;
+
+class Solution {
+    public int distributeCandies(int[] candyType) {
+        Set<Integer> se = new HashSet<>();
+        for (int t : candyType) {
+            se.add(t);
+        }
+        return Math.min(se.size(), candyType.length / 2);
+    }
+}
diff --git a/Codes/0575-distribute-candies_20240602.py b/Codes/0575-distribute-candies_20240602.py
@@ -0,0 +1,11 @@
+'''
+Author: LetMeFly
+Date: 2024-06-02 09:40:48
+LastEditors: LetMeFly
+LastEditTime: 2024-06-02 09:41:08
+'''
+from typing import List
+
+class Solution:
+    def distributeCandies(self, candyType: List[int]) -> int:
+        return min(len(set(candyType)), len(candyType) // 2)
diff --git a/README.md b/README.md
@@ -211,6 +211,7 @@
 |0564.寻找最近的回文数|困难|<a href="https://leetcode.cn/problems/find-the-closest-palindrome/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/03/03/LeetCode%200564.%E5%AF%BB%E6%89%BE%E6%9C%80%E8%BF%91%E7%9A%84%E5%9B%9E%E6%96%87%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/123254172" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-closest-palindrome/solution/letmefly-da-an-hou-xuan-by-letmefly-2-k2vn/" target="_blank">LeetCode题解</a>|
 |0565.数组嵌套|中等|<a href="https://leetcode.cn/problems/array-nesting/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/17/LeetCode%200565.%E6%95%B0%E7%BB%84%E5%B5%8C%E5%A5%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125828684" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/array-nesting/solution/by-tisfy-qior/" target="_blank">LeetCode题解</a>|
 |0567.字符串的排列|中等|<a href="https://leetcode.cn/problems/permutation-in-string/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/03/18/LeetCode%200567.%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/129636871" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/permutation-in-string/solutions/2176236/letmefly-567zi-fu-chuan-de-pai-lie-by-ti-dmer/" target="_blank">LeetCode题解</a>|
+|0575.分糖果|简单|<a href="https://leetcode.cn/problems/distribute-candies/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/02/LeetCode%200575.%E5%88%86%E7%B3%96%E6%9E%9C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139387726" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/distribute-candies/solutions/2798047/letmefly-575fen-tang-guo-mintype-size2-b-e9ub/" target="_blank">LeetCode题解</a>|
 |0589.N叉树的前序遍历|简单|<a href="https://leetcode.cn/problems/n-ary-tree-preorder-traversal/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/02/18/LeetCode%200589.N%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/136149332" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/n-ary-tree-preorder-traversal/solutions/2643982/letmefly-589n-cha-shu-de-qian-xu-bian-li-eip2/" target="_blank">LeetCode题解</a>|
 |0590.N叉树的后序遍历|简单|<a href="https://leetcode.cn/problems/n-ary-tree-postorder-traversal/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/02/19/LeetCode%200590.N%E5%8F%89%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/136167758" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/n-ary-tree-postorder-traversal/solutions/2645454/letmefly-590n-cha-shu-de-hou-xu-bian-li-nqpsr/" target="_blank">LeetCode题解</a>|
 |0592.分数加减运算|中等|<a href="https://leetcode.cn/problems/fraction-addition-and-subtraction/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/27/LeetCode%200592.%E5%88%86%E6%95%B0%E5%8A%A0%E5%87%8F%E8%BF%90%E7%AE%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126011320" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/fraction-addition-and-subtraction/solution/letmefly-592fen-shu-jia-jian-yun-suan-sh-j5qw/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 0575.分糖果.md b/Solutions/LeetCode 0575.分糖果.md
@@ -0,0 +1,132 @@
+---
+title: 575.分糖果
+date: 2024-06-02 09:58:56
+tags: [题解, LeetCode, 简单, 数组, 哈希表]
+---
+
+# 【LetMeFly】575.分糖果：min(type, size/2)
+
+力扣题目链接：[https://leetcode.cn/problems/distribute-candies/](https://leetcode.cn/problems/distribute-candies/)
+
+<p>Alice 有 <code>n</code> 枚糖，其中第 <code>i</code> 枚糖的类型为 <code>candyType[i]</code> 。Alice 注意到她的体重正在增长，所以前去拜访了一位医生。</p>
+
+<p>医生建议 Alice 要少摄入糖分，只吃掉她所有糖的 <code>n / 2</code> 即可（<code>n</code> 是一个偶数）。Alice 非常喜欢这些糖，她想要在遵循医生建议的情况下，尽可能吃到最多不同种类的糖。</p>
+
+<p>给你一个长度为 <code>n</code> 的整数数组 <code>candyType</code> ，返回： Alice <em>在仅吃掉 <code>n / 2</code> 枚糖的情况下，可以吃到糖的 <strong>最多</strong> 种类数</em>。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>candyType = [1,1,2,2,3,3]
+<strong>输出：</strong>3
+<strong>解释：</strong>Alice 只能吃 6 / 2 = 3 枚糖，由于只有 3 种糖，她可以每种吃一枚。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>candyType = [1,1,2,3]
+<strong>输出：</strong>2
+<strong>解释：</strong>Alice 只能吃 4 / 2 = 2 枚糖，不管她选择吃的种类是 [1,2]、[1,3] 还是 [2,3]，她只能吃到两种不同类的糖。
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>candyType = [6,6,6,6]
+<strong>输出：</strong>1
+<strong>解释：</strong>Alice 只能吃 4 / 2 = 2 枚糖，尽管她能吃 2 枚，但只能吃到 1 种糖。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>n == candyType.length</code></li>
+	<li><code>2 &lt;= n &lt;= 10<sup>4</sup></code></li>
+	<li><code>n</code> 是一个偶数</li>
+	<li><code>-10<sup>5</sup> &lt;= candyType[i] &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+
+    
+## 解题方法：比较
+
+限制Alice能吃到糖的种类的因素有两个：
+
+1. 糖本身的种类——无论Alice使用什么策略都无法突破糖原本种类数的限制；
+2. 糖的总个数——医生让她最多吃一半数量的糖。
+
+因此最终答案为$\min(type, \frac{size}2)$
+
++ 时间复杂度$O(size)$
++ 空间复杂度$O(size)$
+
+### AC代码
+
+#### C++
+
+```cpp
+class Solution {
+public:
+    int distributeCandies(vector<int>& candyType) {
+        set<int> se(candyType.begin(), candyType.end());
+        return min(se.size(), candyType.size() / 2);
+    }
+};
+```
+
+#### Go
+
+```go
+package main
+
+func min(a int, b int) int {
+    if a <= b {
+        return a
+    }
+    return b
+}
+
+func distributeCandies(candyType []int) int {
+    se := make(map[int]int)
+    for _, t := range candyType {
+        se[t] = 0
+    }
+    return min(len(se), len(candyType) / 2)
+}
+```
+
+#### Java
+
+```java
+// import java.util.HashSet;
+// import java.util.Set;
+
+class Solution {
+    public int distributeCandies(int[] candyType) {
+        Set<Integer> se = new HashSet<>();
+        for (int t : candyType) {
+            se.add(t);
+        }
+        return Math.min(se.size(), candyType.length / 2);
+    }
+}
+```
+
+#### Python
+
+```python
+# from typing import List
+
+class Solution:
+    def distributeCandies(self, candyType: List[int]) -> int:
+        return min(len(set(candyType)), len(candyType) // 2)
+```
+
+> 同步发文于CSDN和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2024/06/02/LeetCode%200575.%E5%88%86%E7%B3%96%E6%9E%9C/)哦~
+>
+> Tisfy：[https://letmefly.blog.csdn.net/article/details/139387726](https://letmefly.blog.csdn.net/article/details/139387726)
diff --git a/Solutions/Other-Japanese-LearningNotes.md b/Solutions/Other-Japanese-LearningNotes.md
@@ -138,6 +138,7 @@ xx型
 |飲み(のみ)|喝|
 |食べ(たべ)|吃|
 |遊び(あそび)|玩|
+|泳ぎ(およぎ)|游泳|
 |見(み)|看|
 |書き(かき)|写|
 |買い(かい)|买|
@@ -254,6 +255,7 @@ xx型
 |にわ|院子|
 |トイレ|厕所|
 |がっこう|学校|
+|公園(こうえん)|公园|
 |へや|部屋|
 |家(いえ)|家|
 |ぎんこう|银行|
