中级会员
 
- 威望
- 16
- 贡献
- 24
- 热心值
- 0
- 金币
- 315
- 注册时间
- 2020-5-7
|
for (int i = 1; i <= len; i++) {
for (int j = 1; j <= bag; j++) {
//dp[i][j] = dp[i-1][j];
if (j >= w[i - 1]) {
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - w[i - 1]] + v[i - 1]);
} else
dp[i][j] = dp[i - 1][j];
}
}
return dp[len][bag]; for (int i = 1; i <= len; i++) {
for (int j = 1; j <= bag; j++) {
//dp[i][j] = dp[i-1][j];
if (j >= w[i - 1]) {
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - w[i - 1]] + v[i - 1]);
} else
dp[i][j] = dp[i - 1][j];
}
}
return dp[len][bag]; |
|
楼主: oyayio
[复制链接]
发表于 2021-1-18 20:48
