<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 f(self,dp,nums,target,n):
        if target==0:
            return True
        if n==0:
            return False
        if dp[n][target]!=-1:
            return dp[n][target]            

        notinc=self.f(dp,nums,target,n-1)
        if target>=nums[n-1]:
            dp[n][target]=notinc+self.f(dp,nums,target-nums[n-1],n-1)
        else:    
            dp[n][target]=notinc
        return dp[n][target]            
    def canPartition(self, nums: List[int]) -> bool:
        total=sum(nums)
        if total%2!=0:
            return False

        target=total//2
        n=len(nums)
        dp=[[-1 for _ in range(target+1)] for _ in range(n+1)]
        for i in range(target+1):
            dp[0][target]=False
        for i in range(n+1):
            dp[i][0]=True    
        return self.f(dp,nums,target,n)            
                
37038