feat: add solutions to lc problem: No.0575 (#2996)

No.0575.Distribute Candies

Author: yanglbme

solution/0500-0599/0575.Distribute Candies/README.md

@@ -66,7 +66,11 @@ tags:
 
 <!-- solution:start -->
 
-### 方法一
+### 方法一：哈希表
+
+我们用一个哈希表来存储糖果的种类，如果糖果的种类数小于 $n / 2$，那么 Alice 最多可以吃到的糖果种类数就是糖果的种类数；否则，Alice 最多可以吃到的糖果种类数就是 $n / 2$。
+
+时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 为糖果的数量。
 
 <!-- tabs:start -->
 
@@ -98,8 +102,7 @@ class Solution {
 class Solution {
 public:
     int distributeCandies(vector<int>& candyType) {
-        unordered_set<int> s;
-        for (int c : candyType) s.insert(c);
+        unordered_set<int> s(candyType.begin(), candyType.end());
         return min(candyType.size() >> 1, s.size());
     }
 };
@@ -117,6 +120,15 @@ func distributeCandies(candyType []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function distributeCandies(candyType: number[]): number {
+    const s = new Set(candyType);
+    return Math.min(s.size, candyType.length >> 1);
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0500-0599/0575.Distribute Candies/README_EN.md

@@ -64,7 +64,11 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Hash Table
+
+We use a hash table to store the types of candies. If the number of candy types is less than $n / 2$, then the maximum number of candy types that Alice can eat is the number of candy types. Otherwise, the maximum number of candy types that Alice can eat is $n / 2$.
+
+The time complexity is $O(n)$, and the space complexity is $O(n)$. Where $n$ is the number of candies.
 
 <!-- tabs:start -->
 
@@ -96,8 +100,7 @@ class Solution {
 class Solution {
 public:
     int distributeCandies(vector<int>& candyType) {
-        unordered_set<int> s;
-        for (int c : candyType) s.insert(c);
+        unordered_set<int> s(candyType.begin(), candyType.end());
         return min(candyType.size() >> 1, s.size());
     }
 };
@@ -115,6 +118,15 @@ func distributeCandies(candyType []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function distributeCandies(candyType: number[]): number {
+    const s = new Set(candyType);
+    return Math.min(s.size, candyType.length >> 1);
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0500-0599/0575.Distribute Candies/Solution.cpp

@@ -1,8 +1,7 @@
 class Solution {
 public:
     int distributeCandies(vector<int>& candyType) {
-        unordered_set<int> s;
-        for (int c : candyType) s.insert(c);
+        unordered_set<int> s(candyType.begin(), candyType.end());
         return min(candyType.size() >> 1, s.size());
     }
 };

solution/0500-0599/0575.Distribute Candies/Solution.ts

@@ -0,0 +1,4 @@
+function distributeCandies(candyType: number[]): number {
+    const s = new Set(candyType);
+    return Math.min(s.size, candyType.length >> 1);
+}