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