1
class Solution:
2
    def canPartition(self, nums: List[int]) -> bool:
3
        dp, s = set([0]), sum(nums)
4
        if s & 1:
5
            return False
6
        for num in nums:
7
            for curr in range(s >> 1, num - 1, -1):
8
                if curr not in dp and curr - num in dp:
9
                    if curr == s >> 1:
10
                        return True
11
                    dp.add(curr)
12
        return False