solve problem Distribute Candies

Author: P-ppc

README.md

@@ -67,6 +67,7 @@ All solutions will be accepted!
 |669|[Trim A Binary Search Tree](https://leetcode-cn.com/problems/trim-a-binary-search-tree/description/)|[java/py/js](./algorithms/TrimABinarySearchTree)|Easy|
 |806|[Number Of Lines To Write String](https://leetcode-cn.com/problems/number-of-lines-to-write-string/description/)|[java/py/js](./algorithms/NumberOfLinesToWriteString)|Easy|
 |566|[Reshape The Matrix](https://leetcode-cn.com/problems/reshape-the-matrix/description/)|[java/py/js](./algorithms/ReshapeTheMatrix)|Easy|
+|575|[Distribute Candies](https://leetcode-cn.com/problems/distribute-candies/description/)|[java/py/js](./algorithms/DistributeCandies)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/DistributeCandies/README.md

@@ -0,0 +1,2 @@
+# Distribute Candies
+This problem is easy to solve by set

algorithms/DistributeCandies/Solution.java

@@ -0,0 +1,9 @@
+class Solution {
+    public int distributeCandies(int[] candies) {
+        Set<Integer> candyKinds = new HashSet<Integer>();
+        for (int candy : candies) {
+            candyKinds.add(candy);
+        }
+        return candyKinds.size() > candies.length / 2 ? candies.length / 2 : candyKinds.size();
+    }
+}

algorithms/DistributeCandies/solution.js

@@ -0,0 +1,8 @@
+/**
+ * @param {number[]} candies
+ * @return {number}
+ */
+var distributeCandies = function(candies) {
+    let candyKinds = new Set(candies)
+    return candyKinds.size > candies.length / 2 ? candies.length / 2 : candyKinds.size
+};

algorithms/DistributeCandies/solution.py

@@ -0,0 +1,11 @@
+class Solution(object):
+    def distributeCandies(self, candies):
+        """
+        :type candies: List[int]
+        :rtype: int
+        """
+        candy_kinds = set(candies)
+        if len(candy_kinds) > len(candies) / 2:
+            return len(candies) / 2
+        else:
+            return len(candy_kinds)