575. Distribute Candies

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

大致意思是不同数字代表糖果种类，平均分配的条件下，姐姐能获得不同种类的糖果数量最大为多少。

思路如下，首先因为是平均分配，所以最多只能获得总数的一半糖果

之后我们只要统计出糖果的种类数量，和总数一半比较，较小的就是姐姐能获得的数量。

public int distributeCandies(int[] candies) {
        Arrays.sort(candies);  
        int temp = 0;
        int result = 0;
        for(int i=0;i<candies.length;i++)
        {
            if(candies[i]!=temp)
            {
                result+=1;
                temp = candies[i];
            }
        }
        return result<candies.length/2?result:candies.length/2;
    }