<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 f(vector<int>& nums, int k, int ind, vector<vector<int>> dp) {
        if (k == 0)
            return true;
        if (ind == 0)
            return (nums[0] == k);

        if (dp[ind][k] != -1)
            return dp[ind][k];
        bool nottake = f(nums, k, ind - 1, dp);
        bool take = false;
        if (nums[ind] <= k) {
            take = f(nums, k - nums[ind], ind - 1, dp);
        }

        return dp[ind][k] = take | nottake;
    }
    bool canPartition(vector<int>& nums) {
        int sum = 0;
        for (auto it : nums) {
            sum += it;
        }

        vector<vector<bool>> dp(201, vector<bool>(20001, 0));

        if (sum % 2)
            return false;
        else
            sum /= 2;

        for (int i = 0; i < nums.size(); i++) {
            dp[i][0] = true;
        }
        dp[0][nums[0]] = true;

        for (int i = 1; i < nums.size(); i++) {
            for (int target = 1; target <= sum; target++) {
                bool nottake = dp[i-1][target] ;
                bool take = false;
                if (nums[i] <= target) {
                    take = dp[i-1][target-nums[i]] ;
                }
        dp[i][target] = take | nottake;
            }

        }

        return dp[nums.size()-1][sum];
        // return f(nums,sum,nums.size()-1,dp);
    }
};
113763