Commit 20182c7

authored

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

修改错别字

1 parent cd4f67d commit 20182c7Copy full SHA for 20182c7

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -103,7 +103,7 @@ dp[0][j],即:i为0,存放编号0的物品的时候,各个容量的背包`
`103`	`103`
`104`	`104`	`那么很明显当 j < weight[0]的时候,dp[0][j] 应该是 0,因为背包容量比编号0的物品重量还小。`
`105`	`105`
`106`		`-当j >= weight[0]是,dp[0][j] 应该是value[0],因为背包容量放足够放编号0物品。`
	`106`	`+当j >= weight[0]时,dp[0][j] 应该是value[0],因为背包容量放足够放编号0物品。`
`107`	`107`
`108`	`108`	`代码初始化如下:`
`109`	`109`	```

Comments

(0)