LeetCode - 575. Distribute Candies

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

A：

class Solution(object):
    def distributeCandies(self, candies):
        """
        :type candies: List[int]
        :rtype: int
        """
        lenCandies = len(candies)
        typeCount = len(set(candies))
        if typeCount == lenCandies/2:
            return typeCount
        elif typeCount > lenCandies/2:
            return lenCandies/2
        elif typeCount < lenCandies/2:
            return typeCount

简化版：

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

实质是在比较糖果类别的数量和分给妹妹糖果的数量，两数字之间的大小。
分给妹妹糖果的数量，因为是和哥哥平均的，所以数量是糖果总数量的一半。
因此，当类别数k小于妹妹分得的数量，则分得糖果中最多类别数就只有k；当类别数k大于妹妹分得的数量，则分得糖果中的类别最多的情况就是每个都是一个类别；当两者相等，就任取其一就行了。