Code
Code copied to clipboard
Miller-Xie
面试高频算法题总结，个人博客
Results
3
Code issues
Sort by
recently updated
recently updated
newest added
dp.append(dp[i-1] + dp[i-2]) 应该是dp.append(dp[i-1] + 2 * dp[i-2]) 爬i阶楼梯，在i-2阶之上，有两种爬法，1+1， 2
