Class Solution
java.lang.Object
g0501_0600.s0575_distribute_candies.Solution
575 - Distribute Candies.<p>Easy</p>
<p>Alice has <code>n</code> candies, where the <code>i<sup>th</sup></code> candy is of type <code>candyType[i]</code>. Alice noticed that she started to gain weight, so she visited a doctor.</p>
<p>The doctor advised Alice to only eat <code>n / 2</code> of the candies she has (<code>n</code> 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.</p>
<p>Given the integer array <code>candyType</code> of length <code>n</code>, return <em>the <strong>maximum</strong> number of different types of candies she can eat if she only eats</em> <code>n / 2</code> <em>of them</em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> candyType = [1,1,2,2,3,3]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong> Alice can only eat 6 / 2 = 3 candies. Since there are only 3 types, she can eat one of each type.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> candyType = [1,1,2,3]</p>
<p><strong>Output:</strong> 2</p>
<p><strong>Explanation:</strong> 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.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> candyType = [6,6,6,6]</p>
<p><strong>Output:</strong> 1</p>
<p><strong>Explanation:</strong> Alice can only eat 4 / 2 = 2 candies. Even though she can eat 2 candies, she only has 1 type.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>n == candyType.length</code></li>
<li><code>2 <= n <= 10<sup>4</sup></code></li>
<li><code>n</code> is even.</li>
<li><code>-10<sup>5</sup> <= candyType[i] <= 10<sup>5</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
distributeCandies
public int distributeCandies(int[] candyType)
-