更新力扣链接

This commit is contained in:
programmercarl
2022-06-27 09:58:45 +08:00
parent 812aeeda30
commit 1b16a934d6
167 changed files with 189 additions and 189 deletions

View File

@@ -6,7 +6,7 @@
# 746. 使用最小花费爬楼梯
[力扣题目链接](https://leetcode-cn.com/problems/min-cost-climbing-stairs/)
[力扣题目链接](https://leetcode.cn/problems/min-cost-climbing-stairs/)
数组的每个下标作为一个阶梯,第 i 个阶梯对应着一个非负数的体力花费值 cost[i](下标从 0 开始)。