Leetcode学习（30）—— Distribute Candies

最新推荐文章于 2021-11-01 01:49:47 发布

原创最新推荐文章于 2021-11-01 01:49:47 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，未经博主允许不得转载。哈哈哈

文章标签：

#leetcode #numbers #each

Leetcode 专栏收录该内容

53 篇文章

订阅专栏

解决一个整数数组中的糖果分配问题，确保兄妹两人获得相同数量的不同种类的糖果。通过找到不同种类糖果的最大数量来实现公平分配。

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

这里写图片描述

# -*- coding:utf-8 -*-
class Solution(object):
    def distributeCandies(self, candies):
        return min(len(candies)/2, len(set(candies)))

这里写图片描述