algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 12:15:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 背包理论基础01背包JavaScript代码块

Browse Source 
更新背包理论基础01背包JavaScript代码块 - 二维数组做法1， 目前主线上的是有问题的。
This commit is contained in:
JackZJ
2022-04-28 08:30:30 +08:00
committed by GitHub
parent c7e34a3f9b
commit 0694fac15b
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/背包理论基础01背包-1.md
View File

@ -413,7 +413,7 @@ else dp[i][j] = Math.max(dp[i-1][j], dp[i-1][j - weight[i]] + value[i]);
return dp[len-1][size] //满足条件的最大值 return dp[len-1][size] //满足条件的最大值
} }
function testWeightBagProblem2 (wight, value, size)4 { function testWeightBagProblem2 (wight, value, size) {
const len = wight.length, const len = wight.length,
dp = Array(size + 1).fill(0); dp = Array(size + 1).fill(0);
for(let i = 1; i <= len; i++) { for(let i = 1; i <= len; i++) {