<p>Given an integer array <code>nums</code>, return <code>true</code> <em>if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or </em><code>false</code><em> otherwise</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,5,11,5]
<strong>Output:</strong> true
<strong>Explanation:</strong> The array can be partitioned as [1, 5, 5] and [11].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,5]
<strong>Output:</strong> false
<strong>Explanation:</strong> The array cannot be partitioned into equal sum subsets.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 200</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
</ul>

class Solution:
    def canPartition(self, nums: List[int]) -> bool:
        val=sum(nums)
        if val%2!=0:
            return False
        n=len(nums)
        memo=[[None]*n for _ in range(val//2+1)]
        def dp(weight, n):
            if weight==0:
                return True
            if n<0:
                return False
            if memo[weight][n]!=None:
                return memo[weight][n]
            if weight-nums[n]<0:
                memo[weight][n]=dp(weight, n-1)
            else:
                memo[weight][n]=dp(weight-nums[n], n-1) or dp(weight, n-1)
            return memo[weight][n]

        return dp(val//2,n-1)
66806