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

这一题的意思就是给一个数组，里面是数字，不同数字表示不同种类的糖果，把这些糖果平均分配给哥哥和妹妹，问妹妹最多能分到多少种类的糖果？

先上代码：

class Solution(object):
    def distributeCandies(self, candies):
        """
        :type candies: List[int]
        :rtype: int
        """
        max1=len(candies)//2
        max2=len(set(candies))
        return max1 if max1<max2 else max2

s=Solution()
print(s.distributeCandies([1,100,1,100,1,100]))

思路就是她能分到最大的种类，一定不超过糖果种类。而且当糖果种类足够多的时候，她能分到的最大种类是总种类除以二。

当然还有更简短的代码：

class Solution(object):

def distributeCandies(self, candies):
	return min(len(candies) / 2,len(set(candies)))