575. Distribute Candies

最新推荐文章于 2025-11-14 20:40:25 发布

原创最新推荐文章于 2025-11-14 20:40:25 发布 · 755 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #哈希表

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章

订阅专栏

算法/LeetCode

223 篇文章

订阅专栏

本文介绍了一个关于糖果分配的问题，给出了一段C#代码实现。该问题要求将不同种类的糖果平均分配给兄妹两人，并返回妹妹能获得的最大糖果种类数。通过使用HashSet来存储糖果种类，确保了每种糖果只被计数一次。

原题

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.

代码实现

       public int DistributeCandies(int[] candies)
        {
            int n = candies.Length;
            HashSet<int> kinds = new HashSet<int>();
            foreach (var item in candies)
            {
                if (!kinds.Contains(item))
                    kinds.Add(item);
            }
            if (kinds.Count > n/2)
                return n/2; //糖果要均分，所以种类再多，也只能分到n/2种
            return kinds.Count; //种类较少，妹妹最多分到kinds.Count种，如[1,1,1,1], 返回1
        }