摘要：01背包 容量为j，最大价值总和为dp[j] 1 void test_1_wei_bag_problem() { 2 vector<int> weight = {1, 3, 4}; 3 vector<int> value = {15, 20, 30}; 4 int bagWeight = 4; 5 阅读全文