leetcode-70. Climbing Stairs(DP)
2017-05-30 21:16
477 查看
https://leetcode.com/problems/climbing-stairs/#/description
问题描述:楼梯高为n,每次可以爬1或2个台阶问爬到最顶层有多少种方法。
思路解析:简单的递归问题。
代码如下:
问题描述:楼梯高为n,每次可以爬1或2个台阶问爬到最顶层有多少种方法。
思路解析:简单的递归问题。
代码如下:
public class Solution { public int climbStairs(int n) { int[] num =new int ; if(n==0 || n==1 || n==2 )return n; num[0]=1; num[1]=2; for(int i=2;i<n;i++){ num[i]=num[i-1]+num[i-2]; } return num[n-1]; } }
相关文章推荐
- leetcode 70. Climbing Stairs爬梯子(DP问题)
- LeetCode [DP]70. Climbing Stairs
- LeetCode 70. Climbing Stairs(java)
- [LeetCode]70. Climbing Stairs(求爬楼梯有几种方式)
- leetcode_70. Climbing Stairs 爬楼梯,非递归算法
- LeetCode 70. Climbing Stairs
- leetcode题解-70. Climbing Stairs
- LeetCode --- 70. Climbing Stairs
- leetcode 70. Climbing Stairs
- [LeetCode]70. Climbing Stairs
- LeetCode 70. Climbing Stairs (O(n)时间, O(1)空间实现)
- Leetcode 70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- 【算法作业11】LeetCode 70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- LeetCode笔记:70. Climbing Stairs
- leetcode 70. Climbing Stairs
- Leetcode 70. Climbing Stairs