Algorithm


Problem Name: 575. Distribute Candies

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

Code Examples

#1 Code Example with Java Programming

Code - Java Programming


class Solution {
  public int distributeCandies(int[] candyType) {
    return Math.min(
      Arrays.stream(candyType).boxed().collect(Collectors.toSet()).size(),
      candyType.length / 2
    );
  }
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
candyType = [1,1,2,2,3,3]

Output

x
+
cmd
3

#2 Code Example with Javascript Programming

Code - Javascript Programming



const distributeCandies = function(candies) {
  const uniqNum = candies.filter((el, idx, arr) => arr.indexOf(el) === idx)
    .length;
  const halfNum = candies.length / 2;
  return halfNum > uniqNum ? uniqNum : halfNum;
};

console.log(distributeCandies([1, 1, 2, 2, 3, 3]));
console.log(distributeCandies([1, 1, 2, 3]));
Copy The Code & Try With Live Editor

Input

x
+
cmd
candyType = [1,1,2,2,3,3]

Output

x
+
cmd
3

#3 Code Example with Python Programming

Code - Python Programming


class Solution:
    def distributeCandies(self, candies):
        """
        :type candies: List[int]
        :rtype: int
        """
        return len(set(candies)) if len(set(candies))<=len(candies)//2 else len(candies)//2
Copy The Code & Try With Live Editor

Input

x
+
cmd
candyType = [1,1,2,3]

Output

x
+
cmd
2

#4 Code Example with C# Programming

Code - C# Programming


//-----------------------------------------------------------------------------
// Runtime: 264ms
// Memory Usage: 45.1 MB
// Link: https://leetcode.com/submissions/detail/335623583/
//-----------------------------------------------------------------------------

using System;
using System.Collections.Generic;

namespace LeetCode
{
    public class _0575_DistributeCandies
    {
        public int DistributeCandies(int[] candies)
        {
            var set = new HashSet < int>(candies);
            return Math.Min(set.Count, candies.Length / 2);
        }
    }
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
candyType = [1,1,2,3]

Output

x
+
cmd
2
Advertisements

Demonstration


Previous
#572 Leetcode Subtree of Another Tree Solution in C, C++, Java, JavaScript, Python, C# Leetcode
Next
#576 Leetcode Out of Boundary Paths Solution in C, C++, Java, JavaScript, Python, C# Leetcode