Commit a995573

committed

Update 04.Knapsack-Problem-04.md

1 parent e11bc80 commit a995573Copy full SHA for a995573

File tree

1 file changed

-3

lines changed

Contents/10.Dynamic-Programming/04.Knapsack-Problem
- 04.Knapsack-Problem-04.md

1 file changed

-3

lines changed

`‎Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md‎`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@`
`8`	`8`	`>`
`9`	`9`	`> 请问在总重量不超过背包载重上限的情况下,能装入背包的最大价值是多少?`
`10`	`10`
`11`		`-![](https://qcdn.itcharge.cn/images/20230329095653.png)`
	`11`	`+![混合背包问题](https://qcdn.itcharge.cn/images/20240514111727.png)`
`12`	`12`
`13`	`13`	`#### 思路 1:动态规划`
`14`	`14`
`@@ -82,7 +82,7 @@ class Solution:`
`82`	`82`
`83`	`83`	`> 分组背包问题:有 $n$ 组物品和一个最多能装重量为 $W$ 的背包,第 $i$ 组物品的件数为 $group\underline{\hspace{0.5em}}count[i],ドル第 $i$ 组的第 $j$ 个物品重量为 $weight[i][j],ドル价值为 $value[i][j]$。每组物品中最多只能选择 1ドル$ 件物品装入背包。请问在总重量不超过背包载重上限的情况下,能装入背包的最大价值是多少?`
`84`	`84`
`85`		`-![](https://qcdn.itcharge.cn/images/20230329095729.png)`
	`85`	`+![分组背包问题](https://qcdn.itcharge.cn/images/20240514111745.png)`
`86`	`86`
`87`	`87`	`### 6.1 分组背包问题基本思路`
`88`	`88`
`@@ -202,7 +202,7 @@ class Solution:`
`202`	`202`
`203`	`203`	`> 二维费用背包问题:有 $n$ 件物品和有一个最多能装重量为 $W$、容量为 $V$ 的背包。第 $i$ 件物品的重量为 $weight[i],ドル体积为 $volume[i],ドル价值为 $value[i],ドル每件物品有且只有 1ドル$ 件。请问在总重量不超过背包载重上限、容量上限的情况下,能装入背包的最大价值是多少?`
`204`	`204`
`205`		`-![](https://qcdn.itcharge.cn/images/20230329095857.png)`
	`205`	`+![二维费用背包问题](https://qcdn.itcharge.cn/images/20240514111802.png)`
`206`	`206`
`207`	`207`	`### 7.1 二维费用背包问题基本思路`
`208`	`208`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit a995573

File tree

1 file changed

1 file changed

`‎Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md‎`

0 commit comments