575. Distribute Candies

最新推荐文章于 2024-05-28 20:47:24 发布

zg1g

最新推荐文章于 2024-05-28 20:47:24 发布

阅读量683

点赞数 1

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode 哈希表

本文链接：https://blog.csdn.net/daigualu/article/details/71625170

版权

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

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

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
        }