<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 dp[1001][10010];
    bool check(int level,int sum,vector<int>& nums){
        if(level >= nums.size()){
            if(sum == 0){
                return true;
            }
            return false;
        }
        if(dp[level][sum] != -1){
            return dp[level][sum];
        }
        bool notTake = check(level+1,sum,nums);
        bool take=false;
        if(nums[level] <= sum){
            take = check(level+1,sum - nums[level],nums);
        }
        return dp[level][sum] = take | notTake;
    }
    bool canPartition(vector<int>& nums) {
        int sum=accumulate(nums.begin(),nums.end(),0);
        memset(dp,-1,sizeof(dp));
        if(sum % 2 == 0){
            return check(0,sum/2,nums);
        }
        else{
            return false;
        }
        return true;
    }
};
56488