Distribute Candies

最新推荐文章于 2025-04-24 10:37:23 发布

MarchZhen

最新推荐文章于 2025-04-24 10:37:23 发布

阅读量241

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/wuskzuo/article/details/71600745

版权

leetcode 专栏收录该内容

2 篇文章

订阅专栏

本文探讨了如何将不同种类的糖果平均分配给弟弟妹妹的问题，并提供了一种解决方案，通过使用HashSet来统计糖果种类，确保每个人都能得到尽可能多的不同种类的糖果。

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

解题思路：

比较糖果种类和半数糖果的大小，如果半数糖果大则返回糖果种类，否则返回半数糖果。

代码如下：

public class Solution {
    public int distributeCandies(int[] candies) {
        Set dif = new HashSet();
        for(Integer i:candies){
            dif.add(i);
        }
        return (dif.size()>candies.length/2 ? candies.length/2 : dif.size());
    }
}