<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 {
public:
int solve(vector<int>& nums,int n,int sum1,int i, vector<vector<int>>&v)
{
    if(i>=n)return 0;
    if(sum1>0 && i>=n)return 0;
    if(sum1==0)return 1;
    if(v[sum1][i]!=-1)return v[sum1][i];
    int take=0;int nottake=0;
    if(nums[i]<=sum1)
  take=solve(nums,n,sum1-nums[i],i+1,v);
    nottake= solve(nums,n,sum1,i+1,v);
    return v[sum1][i]=take|nottake;
}
    bool canPartition(vector<int>& nums) {
     int n=nums.size();
     int sum=0;
     for(int i=0;i<n;i++)
     {
        sum=sum+nums[i];
     }  
     if(sum%2!=0)return 0;
     int sum1=sum/2;
     vector<vector<int>>v(sum1+1,vector<int>(n,-1));
     return solve(nums,n,sum1,0,v); 
    }
};
116626