034.0-1背包问题

#include<iostream>
#include<vector>
#include<cassert>
#include<algorithm>

using namespace std;

int knapsack(int W, int N, vector<int>& wt, vector<int>& val) {
    // base case 已初始化
    vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
    for (int i = 1; i <= N; i++) {
        for (int w = 1; w <= W; w++) {
            if (w - wt[i - 1] < 0) {
                // 这种情况下只能选择不装入背包
                dp[i][w] = dp[i - 1][w];
            }
            else {
                // 装入或者不装入背包，择优
                dp[i][w] = max(dp[i - 1][w - wt[i - 1]] + val[i - 1],
                    dp[i - 1][w]);
            }
        }
    }

    return dp[N][W];
}

int main()
{
    //N = 3, W = 4
    //wt = [2, 1, 3]
    //val = [4, 2, 3]

    vector<int>wt = { 2,1,3 };
    vector<int>val = { 4,2,3 };
    int N = 3;
    int W = 4;
    int res=knapsack(W, N, wt, val);
    cout << res;

	system("pause");
	return 0;
}