575. Distribute Candies

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. 

• 题目大意：给定一个代表糖果个数的数组，要将糖果平均的分给哥哥和妹妹，求妹妹能获得的最大种类的糖果个数。

• 代码

  package HashTable;
  
  import java.util.HashMap;
  import java.util.HashSet;
  import java.util.Map;
  import java.util.Set;
  
  /**
  * @author OovEver
  * 2018/1/9 9:42
  */
  public class LeetCode575 {
    public int distributeCandies(int[] candies) {
        Set<Integer> kinds = new HashSet<>();
        for(int i=0;i<candies.length;i++) {
            kinds.add(candies[i]);
        }
        return kinds.size() > candies.length / 2 ? candies.length / 2 : kinds.size();
    }
  }