LeetCode: 575. Distribute Candies

最新推荐文章于 2022-08-10 19:04:47 发布

qha0731

最新推荐文章于 2022-08-10 19:04:47 发布

阅读量253

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/qha0731/article/details/74436400

LeetCode 专栏收录该内容

35 篇文章

订阅专栏

本文解析了LeetCode上的575题——分糖果问题，该问题要求将不同种类的糖果平均分配给兄妹两人，并返回妹妹能获得的最大糖果种类数。文章通过示例展示了如何实现这一目标，并提供了一个Java解决方案。

LeetCode: 575. Distribute Candies

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

public class Solution {
    public int distributeCandies(int[] candies) {
        int length = candies.length;
        int half = (int) (length / 2);
        int[] arrays = new int[200001];
        for (int i = 0; i < length; i++) {
            arrays[candies[i] + 100000]++;
        }
        int result = 0;
        for (int i = 0; i < arrays.length; i++) {
            if (arrays[i] > 0) {
                result++;
                if (result > half) {
                    return half;
                }
            }
        }
        return result;
    }
}