416. Partition Equal Subset Sum

Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements
in both subsets is equal.
Note:

Each of the array element will not exceed 100.
The array size will not exceed 200.

Example 1:

Input: [1, 5, 11, 5]

Output: true

Explanation: The array can be partitioned as [1, 5, 5] and [11].

Example 2:

Input: [1, 2, 3, 5]

Output: false

Explanation: The array cannot be partitioned into equal sum subsets.

code:讨论区大佬的代码：
重要的是代码的思路：
class Solution {
public:
bool canPartition(vector<int>& nums) {
int sum=accumulate(nums.begin(),nums.end(),0),target=sum>>1;
if(sum&1) return false;

vector<int> dp(target+1,0);
dp[0]=1;
for(int i=0;i<nums.size();i++)
{
for(int l=target;l>=nums[i];l--)
{
if(dp[l-nums[i]]==true)
dp[l]=true;
}
}
return dp[target];
}
};