[LeetCode] Challenge log 575

Posted on | Edited on |
575. Distribute Candies

Super Straightforward.

if candies kinds > half of total, output the latter; otherwise the former.

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.

Example 1:

1
2
3
4
5
6
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:

1
2
3
4
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.

Note:

  1. The length of the given array is in range [2, 10,000], and will be even.
  2. The number in given array is in range [-100,000, 100,000].
Soulution:
1
2
3
4
5
6
7
class Solution:
    def distributeCandies(self, candies):
        """
        :type candies: List[int]
        :rtype: int
        """
        return min(len(set(candies)), len(candies)//2)
0%