LeetCode Climbing Stairs
来源:互联网 发布:lovelive淘宝推荐 编辑:程序博客网 时间:2024/06/10 16:34
LeetCode解题之Climbing Stairs
原题
一共有n级楼梯,每次能够爬一级或两级,共有多少种不同的爬法爬到顶端。
注意点:
- 无
例子:
输入: n = 6
输出: 13
解题思路
典型的动态规划题,递推表达式为 dp[i]=dp[i-1]+dp[i-2]
,n为1时只有一种方法,n为2时有两种方法。
AC源码
class Solution(object): def climbStairs(self, n): """ :type n: int :rtype: int """ if n <= 2: return n dp = [0 for __ in range(n)] dp[0] = 1 dp[1] = 2 for i in range(2, n): dp[i] = dp[i - 1] + dp[i - 2] return dp[n - 1]if __name__ == "__main__": assert Solution().climbStairs(6) == 13
欢迎查看我的Github (https://github.com/gavinfish/LeetCode-Python) 来获得相关源码。
1 0
- LeetCode: Climbing Stairs
- LeetCode: Climbing Stairs
- [LeetCode]Climbing Stairs
- LeetCode Climbing Stairs
- [Leetcode] Climbing Stairs
- Leetcode: Climbing stairs
- LeetCode Climbing Stairs
- [LeetCode] Climbing Stairs
- leetcode 107: Climbing Stairs
- [LeetCode] Climbing Stairs
- [LeetCode]Climbing Stairs
- [leetcode]Climbing Stairs
- LeetCode-Climbing Stairs
- [leetcode] Climbing Stairs
- LeetCode - Climbing Stairs
- LeetCode:Climbing Stairs
- Leetcode Climbing Stairs
- LeetCode | Climbing Stairs
- HTML5开发移动web应用——Sencha Touch篇(4)
- 两日问题总结
- python random.shuffle(随机打乱列表等) 和 random.random
- Android开源项目总结
- SVM介绍
- LeetCode Climbing Stairs
- this指针的理解
- bzoj1758+WC2010
- 2013百度校招运维dba笔试+三面,社招一面
- 层序遍历二叉树-测试
- 操作系统虚拟化解决方案
- Android Studio 快捷键
- iOS开发-Socket编程
- AVD启动后出现 "Storage space running out"