动态规划3-01背包问题（二维/一维）

//题目：背包问题
//
//给定一组物品，每个物品都有重量和价值，以及一个可以容纳的最大重量的背包。找出能够装入背包的最大价值。
//
//问题函数定义：
//
//cpp
//int knapsack(vector<int>& weights, vector<int>& values, int capacity);
//裁判测试程序样例：
//
//cpp
#include<iostream>
#include<stack>
#include <vector>
#include<string>
#include<algorithm>
#include<unordered_map>
#include <climits>
#include<queue>
#include<unordered_set>
#include<cctype>
using namespace std;
#define maxsize 100
int knapsack(vector<int>& weights, vector<int>& values, int capacity) {
    vector<vector<int>> dp(weights.size() + 1, vector<int>(capacity + 1, 0));
    for (int i = 1; i < weights.size() + 1; i++) {
        for (int j = 1; j < capacity + 1; j++) {
            if (weights[i - 1] > j) {
                dp[i][j] = dp[i - 1][j];
            }
            else {
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weights[i - 1]] + values[i - 1]);
            }
        }
    }
    return dp[weights.size()][capacity];
}
int main() {
    vector<int> weights = { 1, 2, 3 };
    vector<int> values = { 6, 10, 12 };
    int capacity = 5;
    int max_value = knapsack(weights, values, capacity);
    cout << "Maximum value that can be put in knapsack: " << max_value << endl;
    return 0;
}
//输入样例：
//
//1 2 3
//6 10 12
//5
//输出样例：
//
//Maximum value that can be put in knapsack : 22

//也可以使用一维解决

int knapsack(vector<int>& weights, vector<int>& values, int capacity) {
    vector<int> dp(capacity + 1, 0);
    for (int i = 1; i < weights.size() + 1; i++) {
        for (int j = capacity; j >= 1; j--) {
            if (weights[i - 1] <= j) {
                dp[j] = max(dp[j], dp[j - weights[i - 1]] + values[i - 1]);
            }
        }
    }
    return dp[capacity];
}