详见：https://leetcode.com/problems/partition-equal-subset-sum/description/
C++：
class Solution {
public:
bool canPartition(vector<int>& nums)
{
int sum = accumulate(nums.begin(), nums.end(), 0);
if (sum % 2 == 1)
{
return false;
}
int target = sum / 2;
vector<bool> dp(target + 1, false);
dp[0] = true;
for (int i = 0; i < nums.size(); ++i)
{
for (int j = target; j >= nums[i]; --j)
{
dp[j] = dp[j] || dp[j - nums[i]];
}
}
return dp.back();
}
};
参考：http://www.cnblogs.com/grandyang/p/5951422.html
416 Partition Equal Subset Sum
原文：https://www.cnblogs.com/xidian2014/p/8856353.html