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.length2 <= n <= 104n is even.-105 <= candyType[i] <= 105The goal is to find the maximum number of unique types of candies Alice can eat. We can take the following steps:
maxCandies = n / 2.maxCandies.This solution creates a set from the list of candies to determine how many unique types there are. The minimum of the number of unique types and n / 2 candies Alice can eat is the answer.
C
Java
C++
C#
JavaScript
Time Complexity: O(n) because we iterate over the array to create the set.
Space Complexity: O(n) for storing the unique types in a set.
For another perspective:
n / 2.This python solution uses Counter to determine frequency counts, which inherently provides unique element counts. The minimal value between this count and n / 2 determines how many types Alice can eat.
C
Java
C++
C#
JavaScript
Time Complexity: O(n) for creating the counter.
Space Complexity: O(n) for storing unique types in the counter.
| Approach | Complexity |
|---|---|
| Approach 1: Using Sets for Unique Types | Time Complexity: O(n) because we iterate over the array to create the set. |
| Approach 2: Frequency Map and Counting | Time Complexity: O(n) for creating the counter. |
L12. Candy | Slope Approach Intuition Based • take U forward • 61,066 views views
Watch 9 more video solutions →Practice Distribute Candies with our built-in code editor and test cases.
Practice on FleetCode