github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

更新图片链接

Browse Source
This commit is contained in:
kama
2025-05-19 17:11:04 +08:00
parent b489cb69b5
commit ce6e658d14
315 changed files with 2499 additions and 1729 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0746.使用最小花费爬楼梯.md Normal file → Executable file
View File

@@ -52,7 +52,7 @@
请你计算并返回达到楼梯顶部的最低花费。
![](https://file.kamacoder.com/pics/20221031170131.png)
![](https://file1.kamacoder.com/i/algo/20221031170131.png)
## 思路
@@ -112,7 +112,7 @@ dp[i - 2] 跳到 dp[i] 需要花费 dp[i - 2] + cost[i - 2]。
拿示例2：cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1] ，来模拟一下dp数组的状态变化，如下：
![](https://file.kamacoder.com/pics/20221026175104.png)
![](https://file1.kamacoder.com/i/algo/20221026175104.png)
如果大家代码写出来有问题，就把dp数组打印出来，看看和如上推导的是不是一样的。