416. 分割等和子集
笔记
转换为01背包问题
class Solution {
public:
bool canPartition(vector<int>& nums) {
int sum = 0;
for (int i : nums) sum += i;
if (sum % 2 == 1) return false;
int target = sum / 2;
vector<int> dp(target + 1, 0);
for (int i = 0; i < nums.size(); i++) {
for (int j = target; j >= 0; j--) {
if (j >= nums[i]) {
dp[j] = max(dp[j], dp[j - nums[i]] + nums[i]);
}
}
}
if (dp[target] == target) return true;
return false;
}
};