<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:
    bool isEqual(int i,vector<int>& nums,int k,vector<vector<int>>& dp){
        if(k==0)
        return 1;
        else if(k<0)
        return 0;
        if(i==nums.size()){
            return false;
        }
        if(dp[i][k]!=-1)
        return dp[i][k];
        return dp[i][k]=isEqual(i+1,nums,k-nums[i],dp)||isEqual(i+1,nums,k,dp);
    }
    bool canPartition(vector<int>& nums){
        int sum=0,n=nums.size();
        for(int i=0;i<nums.size();i++){
            sum+=nums[i];
        }
        if(sum%2!=0)
        return false;
        vector<vector<int>> dp(n);
        for(int i=0;i<n;i++){
            dp[i]=vector<int>(sum/2+1,-1);
        }        
        return isEqual(0,nums,sum/2,dp);
    }
};
99444