01背包问题的代码问题

[AndrewLawrence80]

如果迭代物品下标从1开始，代码应该是

vector<vector<int>> dp(weight.size()+1, vector<int>(bagweight + 1, 0));
for(int i = 1; i < weight.size(); i++) { // 遍历物品
    for(int j = 0; j <= bagweight; j++) { // 遍历背包容量
        if (j < weight[i-1]) dp[i][j] = dp[i - 1][j]; // i-1的作用是确保第一个物品(下标为0)会被访问到
        else dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weight[i-1]] + value[i-1]);
    }
}
cout << dp[weight.size()][bagweight] << endl;