顿搜
飞过闲红千叶，夕岸在哪
类目归类
[LeetCode 575] Distribute Candies [Java] [Beats : 95.78%]
09/23
1. Description
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.
2. Runtime Distribution
3. Submission Details
4. Example
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.
5. Code
public int distributeCandies(int[] candies) {
if(candies == null || candies.length == 0){
return 0;
}
int total = candies.length / 2;
Set<Integer> set = new HashSet<>();
for(int i = 0; i< candies.length;i++){
set.add(candies[i]);
if(set.size() == total){
return total;
}
}
return set.size();
}6.Test
import java.util.HashSet;
import java.util.Set;
public class LeetCode0575 {
public int distributeCandies(int[] candies) {
if(candies == null || candies.length == 0){
return 0;
}
int total = candies.length / 2;
Set<Integer> set = new HashSet<>();
for(int i = 0; i< candies.length;i++){
set.add(candies[i]);
if(set.size() == total){
return total;
}
}
return set.size();
}
public static void main(String[] args) {
LeetCode0575 leetcode = new LeetCode0575();
int[] candies = new int[]{1,1,2,3};
System.out.println(leetcode.distributeCandies(candies));
}
}
