> For the complete documentation index, see [llms.txt](https://aaronice.gitbook.io/lintcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://aaronice.gitbook.io/lintcode/hash-table/distribute-candies.md).

# Distribute Candies

**Easy**

Given an integer array with **even** length, where different numbers in this array represent different **kinds** of candies. Each number means one candy of the corresponding kind. You need to distribute these candies **equally** in number to brother and sister. Return the maximum number of **kinds** of candies the sister could gain.

**Example 1:**

```
Input:
 candies = [1,1,2,2,3,3]

Output:
 3

Explanation:

There are three different kinds of candies (1, 2 and 3), and two candies for each kind.
Optimal distribution: The sister has candies [1,2,3] and the brother has candies [1,2,3], too. 
The sister has three different kinds of candies.
```

**Example 2:**

```
Input:
 candies = [1,1,2,3]

Output:
 2

Explanation:
 For example, the sister has candies [2,3] and the brother has candies [1,1]. 
The sister has two different kinds of candies, the brother has only one kind of candies.
```

**Note:**

1. The length of the given array is in range \[2, 10,000], and will be even.
2. The number in given array is in range \[-100,000, 100,000].

## Solution & Analysis

记录candies\[]中unique糖果的数量即可，跟candies.length / 2进行比较，最多candies.length / 2，最少set.size();

```java
class Solution {
    public int distributeCandies(int[] candies) {
        HashSet<Integer> set = new HashSet<>();
        for (int candy: candies) {
            set.add(candy);
        }
        return set.size() < candies.length / 2 ? set.size() : candies.length / 2;
    }
}
```

<https://leetcode.com/problems/distribute-candies/solution/>