Merge pull request #2154 from jianghongcheng/master

merge

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

@@ -383,6 +383,21 @@ class Solution:
             return True
         return False
 
+```
+
+卡哥版(简化版)
+```python
+class Solution:
+    def canPartition(self, nums: List[int]) -> bool:
+        if sum(nums) % 2 != 0:
+            return False
+        target = sum(nums) // 2
+        dp = [0] * (target + 1)
+        for num in nums:
+            for j in range(target, num-1, -1):
+                dp[j] = max(dp[j], dp[j-num] + num)
+        return dp[-1] == target
+
 ```
 二维DP版
 ```python