algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0070.爬楼梯.md

Browse Source 
修改错别字
This commit is contained in:
Jeremy Feng
2023-03-07 17:46:03 +08:00
committed by GitHub
parent f88190bdb4
commit 202013fd81
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0070.爬楼梯.md
View File

@ -72,7 +72,7 @@ dp[i]： 爬到第i层楼梯，有dp[i]种方法
3. dp数组如何初始化
在回顾一下dp[i]的定义：爬到第i层楼梯，有dp[i]中方法。
再回顾一下dp[i]的定义：爬到第i层楼梯，有dp[i]中方法。
那么i为0，dp[i]应该是多少呢，这个可以有很多解释，但基本都是直接奔着答案去解释的。