<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 {
    void solve(vector<int>&nums,int i,int val,int sum,vector<vector<bool>>&dp){
        if(i>=nums.size()){
             return;
        }
        if(dp[i][sum]==true){
              return;
        }
        solve(nums,i+1,val,sum+nums[i],dp);
        solve(nums,i+1,val,sum,dp);
        dp[i][sum]=true;
    }
public:
    bool canPartition(vector<int>& nums) {
          int val=0;
          for(int i=0;i<nums.size();i++){
            val+=nums[i];
          }
          if(val%2!=0){
            return false;
          }
          int n=nums.size();
          vector<vector<bool>>dp;
          for(int i=0;i<=n+1;i++){
              vector<bool>temp;
            for(int j=0;j<=val+1;j++){
                 temp.push_back(false);
            }
            dp.push_back(temp);
          }
          val=val/2;
          solve(nums,0,val,0,dp);
         return dp[n-1][val];
    }
};
42169