题目：
题解：
class Solution:def canPartition(self, nums: List[int]) -> bool:n = len(nums)if n < 2:return Falsetotal = sum(nums)if total % 2 != 0:return Falsetarget = total // 2dp = [True] + [False] * targetfor i, num in enumerate(nums):for j in range(target, num - 1, -1):dp[j] |= dp[j - num]return dp[target]
