Add solution #575

Author: JoshCrozier

0575-distribute-candies.js

@@ -0,0 +1,23 @@
+/**
+ * 575. Distribute Candies
+ * https://leetcode.com/problems/distribute-candies/
+ * Difficulty: Easy
+ *
+ * Alice has n candies, where the ith candy is of type candyType[i]. Alice noticed that
+ * she started to gain weight, so she visited a doctor.
+ *
+ * The doctor advised Alice to only eat n / 2 of the candies she has (n is always even).
+ * Alice likes her candies very much, and she wants to eat the maximum number of different
+ * types of candies while still following the doctor's advice.
+ *
+ * Given the integer array candyType of length n, return the maximum number of different
+ * types of candies she can eat if she only eats n / 2 of them.
+ */
+
+/**
+ * @param {number[]} candyType
+ * @return {number}
+ */
+var distributeCandies = function(candyType) {
+  return Math.min(new Set(candyType).size, candyType.length / 2);
+};

README.md

@@ -222,6 +222,7 @@
 565|[Array Nesting](./0565-array-nesting.js)|Medium|
 566|[Reshape the Matrix](./0566-reshape-the-matrix.js)|Easy|
 567|[Permutation in String](./0567-permutation-in-string.js)|Medium|
+575|[Distribute Candies](./0575-distribute-candies.js)|Easy|
 599|[Minimum Index Sum of Two Lists](./0599-minimum-index-sum-of-two-lists.js)|Easy|
 605|[Can Place Flowers](./0605-can-place-flowers.js)|Easy|
 606|[Construct String from Binary Tree](./0606-construct-string-from-binary-tree.js)|Easy|