[LeetCode&Python] Problem 575. Distribute Candies

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了[LeetCode&Python] Problem 575. Distribute Candies，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1168字，纯文字阅读大概需要2分钟。

内容图文

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
        """
        n=len(candies)
        half=n/2
        nu=len(set(candies))
        if half>=nu:
            return int(nu)
        else:
            return int(half)

内容总结

以上是互联网集市为您收集整理的[LeetCode&Python] Problem 575. Distribute Candies全部内容，希望文章能够帮你解决[LeetCode&Python] Problem 575. Distribute Candies所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端