[Leetcode] 575. Distribute Candies

解决一个整数数组中的糖果分配问题,确保兄妹两人获得相同数量的糖果,并最大化妹妹能获得的不同种类糖果的数量。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Description:

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:

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. 
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:

  1. The length of the given array is in range [2, 10,000], and will be even.
  2. The number in given array is in range [-100,000, 100,000].



class Solution {

    public int distributeCandies(int[] candies) {
        int cate = 0;
        Set<Integer> result= new HashSet<Integer>();
        if (candies.length == 0) {
            return 0;
        }
        for (int i = 0; i < candies.length; i++) {
                if (!result.contains(candies[i])) {
                    result.add(candies[i]);
                    cate++;
                }
        }
        if (cate < candies.length / 2) {
            return cate;
        }
        return candies.length/2;
    }
}

P.s. 一开始写的时候  没有用Hashset而用的是arrayList. 导致最后 Time Limit Exceeded了

换成HashSet就好了。!!!Set没有重复!!!!

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值