-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdistrCandy.java
More file actions
69 lines (61 loc) · 2.21 KB
/
distrCandy.java
File metadata and controls
69 lines (61 loc) · 2.21 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
import java.util.*;
public class distrCandy {
public static int distributeCandies(int[] candyType) {
// create freq map
HashMap<Integer, Integer> candyTypes = new HashMap<>();
for (int candy : candyType) {
candyTypes.put(candy, candyTypes.getOrDefault(candy, 0) +1);
}
// map size; number of candies
int numTypes = candyTypes.keySet().size();
System.out.println("12size; " + candyTypes.size());
return Math.min(numTypes, candyType.length/2);
}
public static void main(String[] args) {
int[] n1 = {1,1,2,2,3,3};
System.out.println("Output1: " + distributeCandies(n1));
int[] n2 = {1,1,2,3};
System.out.println("Output2: " + distributeCandies(n2));
int[] n3 = {6,6,6,6};
System.out.println("Output3: " + distributeCandies(n3));
}
}
/*
* https://leetcode.com/problems/distribute-candies/description/
* create freq map of candy
* determine size of map
* return min of map size or n/2
* Time: iterate through the array once; O(n)
* Space: created a hash and var; O(n)
*
* Alice has n candies, where the ith candy is of type candyType[i].
* Alice noticed that she started to gain weight, so she visited a doctor.
The doctor advised Alice to only eat n / 2 of the candies she has
(n is always even). Alice likes her candies very much, and she wants to
eat the maximum number of different types of candies while still following
the doctor's advice.
Given the integer array candyType of length n,
return the maximum number of different types of candies
she can eat if she only eats n / 2 of them.
Example 1:
Input: candyType = [1,1,2,2,3,3]
Output: 3
Explanation: Alice can only eat 6 / 2 = 3 candies.
Since there are only 3 types, she can eat one of each type.
Example 2:
Input: candyType = [1,1,2,3]
Output: 2
Explanation: Alice can only eat 4 / 2 = 2 candies.
Whether she eats types [1,2], [1,3], or [2,3],
she still can only eat 2 different types.
Example 3:
Input: candyType = [6,6,6,6]
Output: 1
Explanation: Alice can only eat 4 / 2 = 2 candies.
Even though she can eat 2 candies, she only has 1 type.
Constraints:
n == candyType.length
2 <= n <= 104
n is even.
-105 <= candyType[i] <= 105
*/