CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-04 03:00:06 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2024-01-12 21:14:29 +08:00
parent 2979889781
commit 6dc2b9eabe
21 changed files with 73 additions and 103 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
chapter_dynamic_programming/unbounded_knapsack_problem/index.html
View File

@@ -2990,11 +2990,11 @@
<li class="md-nav__item">
<a href="#1451" class="md-nav__link">
<span class="md-ellipsis">
14.5.1 &nbsp; 完全背包
14.5.1 &nbsp; 完全背包问题
</span>
</a>
<nav class="md-nav" aria-label="14.5.1   完全背包">
<nav class="md-nav" aria-label="14.5.1   完全背包问题">
<ul class="md-nav__list">
<li class="md-nav__item">
@@ -3571,11 +3571,11 @@
<li class="md-nav__item">
<a href="#1451" class="md-nav__link">
<span class="md-ellipsis">
14.5.1 &nbsp; 完全背包
14.5.1 &nbsp; 完全背包问题
</span>
</a>
<nav class="md-nav" aria-label="14.5.1   完全背包">
<nav class="md-nav" aria-label="14.5.1   完全背包问题">
<ul class="md-nav__list">
<li class="md-nav__item">
@@ -3732,7 +3732,7 @@
<!-- Page content -->
<h1 id="145">14.5 &nbsp; 完全背包问题<a class="headerlink" href="#145" title="Permanent link">&para;</a></h1>
<p>在本节中，我们先求解另一个常见的背包问题：完全背包，再了解它的一种特例：零钱兑换。</p>
<h2 id="1451">14.5.1 &nbsp; 完全背包<a class="headerlink" href="#1451" title="Permanent link">&para;</a></h2>
<h2 id="1451">14.5.1 &nbsp; 完全背包问题<a class="headerlink" href="#1451" title="Permanent link">&para;</a></h2>
<div class="admonition question">
<p class="admonition-title">Question</p>
<p>给定 <span class="arithmatex">\(n\)</span> 个物品，第 <span class="arithmatex">\(i\)</span> 个物品的重量为 <span class="arithmatex">\(wgt[i-1]\)</span>、价值为 <span class="arithmatex">\(val[i-1]\)</span> ，和一个容量为 <span class="arithmatex">\(cap\)</span> 的背包。<strong>每个物品可以重复选取</strong>，问在限定背包容量下能放入物品的最大价值。示例如图 14-22 所示。</p>