Commit 328ffcc

authored

Merge pull request #446 from tlovem/patch-1

Update 背包理论基础01背包-1.md

2 parents ffbe980 + 0aead41 commit 328ffccCopy full SHA for 328ffcc

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -82,7 +82,7 @@ leetcode上没有纯01背包的问题,都是01背包应用方面的题目,`
`82`	`82`
`83`	`83`	`那么可以有两个方向推出来dp[i][j],`
`84`	`84`
`85`		`-* 由dp[i - 1][j]推出,即背包容量为j,里面不放物品i的最大价值,此时dp[i][j]就是dp[i - 1][j]`
	`85`	`+* 由dp[i - 1][j]推出,即背包容量为j,里面不放物品i的最大价值,此时dp[i][j]就是dp[i - 1][j]。(其实就是当物品i的重量大于背包j的重量时,物品i无法放进背包中,所以被背包内的价值依然和前面相同。)`
`86`	`86`	`* 由dp[i - 1][j - weight[i]]推出,dp[i - 1][j - weight[i]] 为背包容量为j - weight[i]的时候不放物品i的最大价值,那么dp[i - 1][j - weight[i]] + value[i] (物品i的价值),就是背包放物品i得到的最大价值`
`87`	`87`
`88`	`88`	`所以递归公式: dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weight[i]] + value[i]);`

Comments

(0)