声明:本题及相关刷题笔记同步github之中,欢迎Fork & Star GitHub:https://github.com/HoqiheChen。如有不足之处,烦请改正。QQ Mail:851774342@qq.com
Description
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Brief
剑指offer“跳台阶问题”。
Input
(1)2
(2)3
Output
(1)2
(2)3
Explanation
Given n will be a positive integer.
Ideas
递归和DP两种思路。到达n阶台阶是由n-1阶的方法和n-2阶方法的和。
(递归的思路LeetCode有时间限制-_-||)
Code
//dp思路
class Solution {
public int climbStairs(int n) {
if(n <= 0)
return 0;
if(n == 1){
return 1;
}if(n == 2){
return 2;
}
int[] dp = new int[n+1];
dp[0]=0;
dp[1]=1;
dp[2]=2;
for(int i = 3; i <= n; i++){
dp[i] = dp[i-1]+dp[i-2];
}
return dp[n];
}
}
//递归思路
class Solution {
public int climbStairs(int n) {
if(n == 1){
return 1;
}
if(n == 2){
return 2;
}
return climbStairs(n - 1) + climbStairs(n - 2);
}
}
声明:本题及相关刷题笔记同步github之中,欢迎Fork & Star GitHub:https://github.com/HoqiheChen。如有不足之处,烦请改正。QQ Mail:851774342@qq.com