Merge pull request #293 from LiangDazhu/patch-23

Update 0416.分割等和子集.md

problems/0416.分割等和子集.md

@@ -222,8 +222,18 @@ class Solution {
 ```
 
 Python：
-
-
+```python
+class Solution:
+    def canPartition(self, nums: List[int]) -> bool:
+        taraget = sum(nums)
+        if taraget % 2 == 1: return False
+        taraget //= 2
+        dp = [0] * 10001
+        for i in range(len(nums)):
+            for j in range(taraget, nums[i] - 1, -1):
+                dp[j] = max(dp[j], dp[j - nums[i]] + nums[i])
+        return taraget == dp[taraget]
+```
 Go：