LeetCode-575. Distribute Candies

发布于 2017-07-11 05:09:52

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


这个是分糖果的题,这个问题其实就是分两种情况,一种是set(candies)大于等于len(candies)/2的情况,这时候姐姐就可以得到len(candies)/2不同的糖果,当set(candies)比len(candies)/2小的时候,姐姐最多就可以得到len(set(candies))种不同的糖果。

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