575. Distribute Candies

最新推荐文章于 2021-11-01 20:58:27 发布

jianingkid

最新推荐文章于 2021-11-01 20:58:27 发布

阅读量226

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/jianingkid/article/details/75040446

leetcode 专栏收录该内容

96 篇文章

订阅专栏

解决一个关于如何将不同种类的糖果平均分配给两个人的问题。输入为一个整数数组，每个数字代表一种类型的糖果，输出为一个人可以得到的最大不同种类糖果的数量。

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

Note:

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

男女两种人分糖果，女生最多能分几种糖果，假设m颗糖里面有n种糖果，那女生最多就是看糖果种类个数会否大于m/2

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