feat: 575.distribute-candies update Python3 implementation (azl397985856#157)

ybian19 · azl397985856 · commit 35d8ef95080d · 2019-09-02T11:12:19.000+08:00
diff --git a/problems/575.distribute-candies.md b/problems/575.distribute-candies.md
@@ -1,4 +1,3 @@
-
 ## 题目地址
 https://leetcode.com/problems/distribute-candies/description/
 
@@ -11,13 +10,13 @@ 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. 
+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. 
+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.
@@ -43,6 +42,10 @@ The number in given array is in range [-100,000, 100,000].
 
 ## 代码
 
+* 语言支持：JS, Python
+
+Javascript Code:
+
 ```js
 /*
  * @lc app=leetcode id=575 lang=javascript
@@ -59,4 +62,10 @@ var distributeCandies = function(candies) {
 };
 ```
 
+Python Code:
 
+```python
+class Solution:
+    def distributeCandies(self, candies: List[int]) -> int:
+        return min(len(set(candies)), len(candies) >> 1)
+```
