題目
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].
難度
Easy
方法
使用set耗美。假設(shè)糖果總數(shù)為n让虐，糖果種類為m，取m和n/2的最小值即為sister可以獲得的最大的糖果種類數(shù)
python代碼
class Solution(object):
def distributeCandies(self, candies):
"""
:type candies: List[int]
:rtype: int
"""
return min(len(candies)/2, len(set(candies)))
assert Solution().distributeCandies([1,1,2,2,3,3]) == 3
assert Solution().distributeCandies([1,1,2,3]) == 2
assert Solution().distributeCandies([1,1,1,1]) == 1
