mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2026-02-02 18:39:09 +08:00
替换图片链接
This commit is contained in:
@@ -101,7 +101,7 @@ dp[i]: 爬到第i层楼梯,有dp[i]种方法
|
||||
举例当n为5的时候,dp table(dp数组)应该是这样的
|
||||
|
||||
|
||||

|
||||

|
||||
|
||||
如果代码出问题了,就把dp table 打印出来,看看究竟是不是和自己推导的一样。
|
||||
|
||||
|
||||
Reference in New Issue
Block a user