随笔分类 - 背包问题

LeetCode 494. 目标和

摘要：//设正整数值为x，那么负整数绝对值为sum - x //target = x - (sum - x) //x = (target + sum) / 2 const int N = 1010; class Solution { public: int dp[N]; int findTargetSum 阅读全文

posted @ 2022-09-13 15:13 hjy94wo 阅读(6) 评论(0) 推荐(0) 编辑

LeetCode 1049. 最后一块石头的重量 II

摘要：const int N = 3010; class Solution { public: int dp[N]; int lastStoneWeightII(vector<int>& stones) { int sum = 0; for (int i = 0; i < stones.size(); i 阅读全文

posted @ 2022-09-13 14:45 hjy94wo 阅读(11) 评论(0) 推荐(0) 编辑

LeetCode 416. 分割等和子集

摘要：01背包 const int N = 20010; class Solution { public: int dp[N]; bool canPartition(vector<int>& nums) { int sum = 0; for (int i = 0; i < nums.size(); i + 阅读全文

posted @ 2022-09-13 10:52 hjy94wo 阅读(11) 评论(0) 推荐(0) 编辑