LeetCode - 575. Distribute Candies

最新推荐文章于 2025-08-23 19:36:46 发布

weixin_33713350

最新推荐文章于 2025-08-23 19:36:46 发布

阅读量63

点赞数

CC 4.0 BY-SA版权

文章标签： java

原文链接：http://www.cnblogs.com/wxisme/p/7281250.html

本文介绍了一个糖果分配问题：如何将不同种类的糖果等量地分配给兄妹两人，并确保妹妹获得尽可能多的不同种类的糖果。通过Java实现了一种解决方案，利用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.

import java.util.Set;
public class Solution {
    public int distributeCandies(int[] candies) {
        
        if (candies == null || candies.length == 0)
            return 0;
        
       Set<Integer> set = new HashSet<Integer>();
        for (int c : candies)
            set.add(c);
        return set.size() > candies.length / 2 ? candies.length / 2 : set.size();
    }
}

转载于:https://www.cnblogs.com/wxisme/p/7281250.html