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

        return dp[sum][n];
    }
};
116626