共计 1098 个字符，预计需要花费 3 分钟才能阅读完成。
题目
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].
题目地址
讲解
要让妹妹的蜡烛种类尽量多，很简单，尝试把每种不同的蜡烛都塞给妹妹，但她最多只能拿一半。
java 代码
class Solution {
public int distributeCandies(int[] candies) {
Set<Integer> set = new HashSet<>();
for(int x:candies){
set.add(x);
}
int result=0;
if(set.size()>candies.length/2){
result = candies.length/2;
}else{
result = set.size();
}
return result;
}
}