【LeetCode】575. Distribute Candies

Python版本：python3.6.2

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:
The length of the given array is in range [2, 10,000], and will be even.
The number in given array is in range [-100,000, 100,000].

前几次被二叉树的题目虐的不要不要的，到现在还是搞不明白关于二叉树和循环迭代的题目怎么做，关键是大神们是怎么在自己的IDE上调试的(ˉ▽ˉ；)...求教啊

像这种题目理解了，找到思路，最多百度下函数，就解出来了。

上代码：

class Solution:
    def distributeCandies(self, candies):
        """
        :type candies: List[int]
        :rtype: int
        """
        return len(set(candies)) if len(set(candies)) <= int(len(candies)/2) else int(len(candies)/2)

检验下：

a = Solution()
print(a.distributeCandies(candies=[1,1,2,2,3,3]))

答案：

"D:\Program files\python3.6.2\python.exe" "D:/sunfl/sunflower/study/LeetCode/575. Distribute Candies/575. Distribute Candies.py"
3

进程已结束,退出代码0

速度：

再来看看更好的Solution:

def distributeCandies(self, candies):
    return min(len(candies) / 2, len(set(candies)))

(lll￢ω￢)突然感觉自己好傻，为啥要if else判断，emm.....