20170612-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:

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].
   解读
   有个sister和brother，有一群糖，糖的种类有多个，每一类有一个或者多个，问sister能够分得到最多糖的种类的个数，直接限制条件是两个boy分到的糖的个数是相等的，比如：【1,1,2,2,3,3】代表有3种糖，每种糖的个数为两个，那么sister可以分到3种（1,2,3）

2.Solution

思路：如果种类大于糖总数的一半，那么受到两个boy得到个数相等的条件，sister能够得到一半的糖，如果小于等于，那么就能够得到所有的种类，返回（糖的种类，糖的个数一半）最小值即可

class Solution(object):
    def distributeCandies(self, candies):
        """
        :type candies: List[int]
        :rtype: int
        """
        return min(int(len(candies) / 2), len(set(candies)))