[Leetcode] 575. Distribute Candies 解题报告-优快云博客

本文链接：https://blog.youkuaiyun.com/magicbean2/article/details/78900293

解决一个关于如何将不同种类的糖果平均分配给兄妹两人的问题，通过算法找出妹妹能获得的最大种类数量。

摘要生成于 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].

思路：

看看一共有多少种糖果，如果糖果的种类小于糖果个数的一半，妹妹就最多可以分到糖果种类数那么多种糖果；否则妹妹最多可分到糖果个数的一半那么多种糖果。

代码：

class Solution {
public:
    int distributeCandies(vector<int>& candies) {
        unordered_set<int> hash;
        for (int candy : candies) {
            hash.insert(candy);
        }
        return min(candies.size() / 2, hash.size());
    }
};