<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 target;
    vector<int> nums;
    int n;
    unordered_map<int, bool> myMap[205];    
    bool canPartition(vector<int>& nums) 
    {
        
        int sum = accumulate(nums.begin(), nums.end(), 0);
        if(sum % 2 == 1) return false;
        sort(nums.rbegin(), nums.rend());
        this->nums = nums;
        target = sum/2;
        n = nums.size();

        return (dfs(0, 0));
    }
    bool dfs(int cur, int sum)
    {
        if(sum == target) return true;
        if(sum > target) return false;
        if(myMap[cur].find(sum) != myMap[cur].end())
            return myMap[cur][sum];
        for(int i=cur; i<n; i++)
        {
            if (dfs(i+1, sum + nums[i]))
            {
                myMap[cur][sum] = true;
                return true;
            }
        }
        myMap[cur][sum] = false;
        return false;
    }
};
59351