575. Distribute Candies

Posted bernieloveslife

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了575. Distribute Candies相关的知识,希望对你有一定的参考价值。

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:

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:

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].
class Solution:
    def distributeCandies(self, candies):
        """
        :type candies: List[int]
        :rtype: int
        """
        dic = {}
        for i in candies:
            if i not in dic:
                dic[i] = 1
            else:
                dic[i] += 1
        n = len(candies)//2
        a = 0
        for i in dic.values():
            a +=i-1
        print(a,n)
        if a>=n:
            return len(dic.keys())
        else:
            return len(dic.keys()) - n + a








以上是关于575. Distribute Candies的主要内容,如果未能解决你的问题,请参考以下文章

575. Distribute Candies

575. Distribute Candies

575. 分配糖果 Distribute Candies

575. Distribute Candies

575. Distribute Candies

575. Distribute Candies