题一:分割等和子集
题目链接: 分割等和子集
解题思路: 01背包的思路。
解题代码:
var canPartition = function (nums) {
let targetsum = nums.reduce((a, b) => a + b);
// target = targetsum / 2
if ((targetsum % 2) !== 0) return false;
let target = targetsum / 2;
console.log(targetsum % 2, target);
// dp[target] === target
// dp[j] = max(dp[j],dp[j-weight[i]] + value[i])
// dp[j] = max(dp[j],dp[j-nums[i]] + nums[i]);
// 初始化:dp[i] = 0;
let dp = new Array(target + 1).fill(0);
for (let i = 1; i <= nums.length; i++) { // 遍历物品
for (let j = target; j >= nums[i]; j--) { // 遍历背包
dp[j] = Math.max(dp[j], dp[j - nums[i]] + nums[i]);
}
}
return dp[target] === target;
};