DistributeCandies

最新推荐文章于 2025-08-07 20:58:17 发布

原创最新推荐文章于 2025-08-07 20:58:17 发布 · 283 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

leetcode 专栏收录该内容

16 篇文章

订阅专栏

本文探讨了一个有趣的问题：如何将不同种类的糖果平均分配给兄妹两人。通过一个示例问题，我们介绍了使用C++实现的解决方案，该方案利用哈希表来计算妹妹可以获得的最大糖果种类数。

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

Distribute Candies

第5天第10题

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.

代码

    int distributeCandies(vector<int>& candies) {
        unordered_map<int, int> map{};

        for (auto candiesIter = candies.begin(); candiesIter != candies.end(); candiesIter++)
        {
            if(map.count(*candiesIter)==0)
            {
                map[*candiesIter]=1;
            } else{
                map[*candiesIter]++;
            }
        }
        if(map.size()>=(candies.size()/2))
            return candies.size()/2;
        else return map.size();
    }

unordered_map<int, int> map(candies.size());

        for (auto candiesIter = candies.begin(); candiesIter != candies.end()
        &&map.size()>=(candies.size()/2); candiesIter++)
        {
            if(map.count(*candiesIter))
            {
                map[*candiesIter]=1;
            } else{
                map[*candiesIter]++;
            }
        }
        if(map.size()>=(candies.size()/2))
            return candies.size()/2;
        else return map.size();