This commit is contained in:
krahets
2023-07-31 03:27:17 +08:00
parent 5039f48f06
commit a5fc6d3215
13 changed files with 737 additions and 367 deletions

View File

@ -3729,7 +3729,7 @@ dp[i-1] , dp[i-2] , \cdots , dp[2] , dp[1]
<div class="arithmatex">\[
dp[i] = dp[i-1] + dp[i-2]
\]</div>
<p>这意味着在爬楼梯问题中,<strong>各个子问题之间不是相互独立的,原问题的解可以子问题的解构建得来</strong></p>
<p>这意味着在爬楼梯问题中,各个子问题之间存在递推关系,<strong>原问题的解可以子问题的解构建得来</strong></p>
<p><img alt="方案数量递推关系" src="../intro_to_dynamic_programming.assets/climbing_stairs_state_transfer.png" /></p>
<p align="center"> Fig. 方案数量递推关系 </p>