[LeetCode]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:

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

我提供一种方法

sister最后分到的糖果最多是数组长度的一半，这个问题实际上是求一个数组中不同元素的个数，所以我定义了一个函数getKinds获取数组中不同元素的个数，最后和数组长度的一半作比较就可以了。

import java.util.*;
class Solution {
    public int distributeCandies(int[] candies) {
        int count = getKinds(candies);
        int n = candies.length;
        if(count>n/2)
            return n/2;
        else
            return count;
    }
    public int getKinds(int[] a){
        Set<Integer> kinds = new HashSet<>();
        for( int i:a ){
            kinds.add(i);
        }
        return kinds.size();
    }
}

谢谢你长得这么好看，还耐心地看到了这儿。