Force buckle 575 Divide candy

Alice Yes n Piece sugar , Among them the first i The type of sugar is candyType[i] .Alice Notice that she's gaining weight , So I went to visit a doctor .

The doctor suggested Alice Eat less sugar , Just eat all her sugar n / 2 that will do （n It's an even number ）.Alice I like these sweets very much , She wants to follow the doctor's advice , Eat as many different kinds of sugar as possible .

Give you a length of n Array of integers for candyType , return ： Alice Eat only n / 2 In the case of sugar , You can eat sugar most Number of species .

Example 1：

Input ：candyType = [1,1,2,2,3,3]
Output ：3
explain ：Alice Can only eat 6 / 2 = 3 Piece sugar , Because only 3 Seed sugar , She can eat one of each .
Example 2：

Input ：candyType = [1,1,2,3]
Output ：2
explain ：Alice Can only eat 4 / 2 = 2 Piece sugar , No matter what kind of food she chooses to eat [1,2]、[1,3] still [2,3], She can only eat two different kinds of sugar .
Example 3：

Input ：candyType = [6,6,6,6]
Output ：1
explain ：Alice Can only eat 4 / 2 = 2 Piece sugar , Although she can eat 2 gold , But you can only eat 1 Seed sugar .

source ： Power button （LeetCode）
link ：https://leetcode-cn.com/problems/distribute-candies
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

###  Their thinking

Here is the solution

The minimum value of the number of optional candy types and half of the number of all tangs is returned

###  Code

```javascript

/**

 * @param {number[]} candyType

 * @return {number}

 */

var distributeCandies = function(candyType) {

    

    return Math.min(candyType.length/2,[...new Set(candyType)].length)

};

```