<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:
vector<vector<int>>dp;
bool f(vector<int>&v,int t,int i ){
    if(t<0)return false;
    if(t==0)return true;
    if(dp[i][t]!=-1)return dp[i][t];
    if(i>=v.size()&&t!=0)return false;
    return dp[i][t]= f(v,t-v[i],i+1)||f(v,t,i+1);
}
    bool canPartition(vector<int>& v) {
int sum=0;
for(int i=0;i<v.size();i++){
sum+=v[i];
}
if(sum%2==1)return false;
sum/=2;
         dp.resize(205,vector<int>(sum+5,-1));
        
        return f(v,sum,0);
    }
};
159583