<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 canPartition(vector<int>& nums) {
        int sum = accumulate(nums.begin(), nums.end(), 0);
        if(sum%2)
            return false;
        int n = nums.size();
        int req = sum / 2;
        vector<vector<bool>> dp(req + 1, vector<bool>(n+1));
        for(int i = 0; i <= n; ++i)
            dp[0][i] = true;
        for(int i = 1; i <= req; ++i)
            dp[i][0] = false;
        for(int i = 1; i <= req; ++i) {
            for(int j = 1; j <= n; ++j) {
                if(nums[j - 1] > i)
                    dp[i][j] = dp[i][j-1];
                else {
                    dp[i][j] = dp[i - nums[j-1]][j-1] | dp[i][j-1];
                }
            }
        }
        return dp[req][n];
    }
};
27850