Commit ba19b32

committed

Update 05.Knapsack-Problem-05.md

1 parent af784de commit ba19b32Copy full SHA for ba19b32

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -27,7 +27,7 @@`
`27`	`27`
`28`	`28`	`#### 思路 1:动态规划 + 一维状态`
`29`	`29`
`30`		`-1. 划分阶段:按照物品种类的序号、当前背包的载重上限进行阶段划分。`
	`30`	`+1. 划分阶段:按照当前背包的载重上限进行阶段划分。`
`31`	`31`	`2. 定义状态:定义状态 $dp[w]$ 表示为:将物品装入一个最多能装重量为 $w$ 的背包中,恰好装满背包的情况下,能装入背包的最大价值总和。`
`32`	`32`	`3. 状态转移方程:$dp[w] = dp[w] + dp[w - weight[i - 1]]$`
`33`	`33`	`4. 初始条件:`

Comments

(0)