This commit is contained in:
krahets
2023-07-07 21:39:04 +08:00
parent 25a9c76f32
commit 07d249a4de
87 changed files with 1561 additions and 215 deletions
@@ -1959,6 +1959,8 @@
@@ -2014,9 +2016,23 @@
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/dp_solution_pipeline.md" class="md-nav__link">
13.3. &nbsp; DP 解题步骤(New
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
13.3. &nbsp; 0-1 背包问题(New
13.4. &nbsp; 0-1 背包问题(New
</a>
</li>
+21 -5
View File
@@ -2054,6 +2054,8 @@
@@ -2109,9 +2111,23 @@
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/dp_solution_pipeline.md" class="md-nav__link">
13.3. &nbsp; DP 解题步骤(New
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
13.3. &nbsp; 0-1 背包问题(New
13.4. &nbsp; 0-1 背包问题(New
</a>
</li>
@@ -3290,22 +3306,22 @@
</thead>
<tbody>
<tr>
<td><span class="arithmatex">\(&gt;0\)</span> (即左偏树)</td>
<td><span class="arithmatex">\(&gt;1\)</span> (即左偏树)</td>
<td><span class="arithmatex">\(\geq 0\)</span></td>
<td>右旋</td>
</tr>
<tr>
<td><span class="arithmatex">\(&gt;0\)</span> (即左偏树)</td>
<td><span class="arithmatex">\(&gt;1\)</span> (即左偏树)</td>
<td><span class="arithmatex">\(&lt;0\)</span></td>
<td>先左旋后右旋</td>
</tr>
<tr>
<td><span class="arithmatex">\(&lt;0\)</span> (即右偏树)</td>
<td><span class="arithmatex">\(&lt;-1\)</span> (即右偏树)</td>
<td><span class="arithmatex">\(\leq 0\)</span></td>
<td>左旋</td>
</tr>
<tr>
<td><span class="arithmatex">\(&lt;0\)</span> (即右偏树)</td>
<td><span class="arithmatex">\(&lt;-1\)</span> (即右偏树)</td>
<td><span class="arithmatex">\(&gt;0\)</span></td>
<td>先右旋后左旋</td>
</tr>
+17 -1
View File
@@ -1993,6 +1993,8 @@
@@ -2048,9 +2050,23 @@
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/dp_solution_pipeline.md" class="md-nav__link">
13.3. &nbsp; DP 解题步骤(New
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
13.3. &nbsp; 0-1 背包问题(New
13.4. &nbsp; 0-1 背包问题(New
</a>
</li>
+17 -1
View File
@@ -2000,6 +2000,8 @@
@@ -2055,9 +2057,23 @@
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/dp_solution_pipeline.md" class="md-nav__link">
13.3. &nbsp; DP 解题步骤(New
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
13.3. &nbsp; 0-1 背包问题(New
13.4. &nbsp; 0-1 背包问题(New
</a>
</li>
+17 -1
View File
@@ -1992,6 +1992,8 @@
@@ -2047,9 +2049,23 @@
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/dp_solution_pipeline.md" class="md-nav__link">
13.3. &nbsp; DP 解题步骤(New
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
13.3. &nbsp; 0-1 背包问题(New
13.4. &nbsp; 0-1 背包问题(New
</a>
</li>
+17 -1
View File
@@ -1904,6 +1904,8 @@
@@ -1959,9 +1961,23 @@
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/dp_solution_pipeline.md" class="md-nav__link">
13.3. &nbsp; DP 解题步骤(New
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
13.3. &nbsp; 0-1 背包问题(New
13.4. &nbsp; 0-1 背包问题(New
</a>
</li>
+17 -1
View File
@@ -1945,6 +1945,8 @@
@@ -2000,9 +2002,23 @@
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/dp_solution_pipeline.md" class="md-nav__link">
13.3. &nbsp; DP 解题步骤(New
</a>
</li>
<li class="md-nav__item">
<a href="../../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
13.3. &nbsp; 0-1 背包问题(New
13.4. &nbsp; 0-1 背包问题(New
</a>
</li>