Leetcode #575. Distribute Candies_leetcode distribute candies-优快云博客

本文链接：https://blog.youkuaiyun.com/lhppom/article/details/79506048

本文探讨了如何将一组包含偶数数量的糖果公平地分配给两个人，同时确保其中一人能获得尽可能多的不同种类的糖果。通过使用Python中的set数据结构来统计不同种类的糖果数量，并运用简单的数学比较逻辑来实现最优分配。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

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

题意

题目的意思就是给出一堆偶数的糖果需要平均分给两个人，但是其中一个分到的糖果的种类尽可能的多

想法

假设一下如果糖果种类足够多，那就可以分到的一半的糖果都是不一样的，如果少一些就直接先不同种类的拿一个，最后再在里面每种多挑一些补齐就行了，那就是需要统计糖果的种类数和数量进行比较，用python的set就可以构造出一个互异的集合也就不同种类糖果的编号，最后的比较还能再用min函数简化一下

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