leetcode575. Distribute Candies

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

原创最新推荐文章于 2021-11-01 20:58:27 发布 · 255 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #hashTable

leetcode 专栏收录该内容

187 篇文章

订阅专栏

解决一个整数数组中的糖果分配问题，确保兄妹两人获得相同数量的不同种类糖果，返回妹妹可以获得的最大不同种类糖果的数量。

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].
Subscribe to see which companies asked this question.

解法

将数组中的元素放到set中，最后取set的大小和candies数组长度的1/2的最小值返回。

public class Solution {
    public int distributeCandies(int[] candies) {
        if (candies.length == 0 || candies == null) {
            return 0;
        }

        Set<Integer> set = new HashSet<Integer>();
        for (int candie : candies) {
            set.add(candie);
        }

        return Math.min(set.size(), candies.length / 2);
    }
}