1,题目描述
2,题目分析
https://leetcode-cn.com/problems/partition-equal-subset-sum/comments/
3,代码实现
class Solution {
public:
bool canPartition(vector<int>& nums) {
int sum=accumulate(nums.begin(),nums.end(),0);
int target=sum/2;
if(target*2!=sum) return false;
vector<bool> dp(target+1,false);
dp[0]=true;
for(auto num:nums){
for(int i=target;i>=num;i--){
dp[i]=dp[i] || dp[i-num];
}
}
return dp.back();
}
};