575. Distribute Candies

Problem Statement

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].

Thinking

现在我有十块糖。假如有四种类型。十块糖最多可以拿到五块糖，因此四种类型的糖都可以拿到；假如有六种类型，那我最多也只能拿到五种糖。因此只需要比较这两个数目就OK。

Solution

class Solution {
    public int distributeCandies(int[] candies) {
        HashSet h = new HashSet();
        for(int i = 0; i < candies.length;i++){
            h.add(candies[i]);
        }
        return  candies.length / 2 <  h.size() ? candies.length / 2 :  h.size() ;
    }
}
    }
};