575. Distribute Candies

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

原创最新推荐文章于 2022-08-10 19:04:47 发布 · 317 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

59 篇文章

订阅专栏

解决一个算法问题，即如何将糖果数组平均分成两份，使得其中一份包含尽可能多的不同种类的糖果。通过使用HashSet来记录不同种类的糖果数量，并比较其与数组长度一半的较小值来得出最优解。

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

575. Distribute Candie

Description Hints Submissions Solutions

Total Accepted: 12203
Total Submissions: 20276
Difficulty: Easy
Contributors:fallcreek

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

题意：

把一个数组分成两份，使一份中不同数字的种类尽可能多

算法思路：

问题可以转化为返回数组的大小/2，和数字种类两个中的较小值

用一个集合（set）不断往里面加值，set的大小的就是数字的种类

代码：

package easy;

import java.util.Collection;
import java.util.HashSet;

public class DistributeCandies {
	
	public static int distributeCandies(int[] candies) {
        Collection hashSet = new HashSet();
        for(int i=0; i<candies.length; i++){
        	hashSet.add(candies[i]);
        }
        return Math.min(hashSet.size(), candies.length/2);
    }
	
	public static void main(String[] args){
		int[] candies = {1,1,2,3};
		System.out.println(distributeCandies(candies));
	}
}

LeetCode的编译器好像写Collection会报错，可以改为Hashset