假设你正在爬楼梯,需要n步你才能到达顶部。但每次你只能爬一步或者两步,你能有多少种不同的方法爬到楼顶部?
比如n=3,1+1+1=1+2=2+1=3,共有3中不同的方法
返回 3
//动态规划
public class Solution {
public int climbStairs(int n) {
if (n <= 1) return 1;
int[] dp = new int[n];
dp[0] = 1; dp[1] = 2;
for (int i = 2; i < n; ++i) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n - 1];
}
}
//博客
//迭代
/*public class Solution {
public int climbStairs(int n) {
// write your code here
if(n == 0) return 1;
if(n == 1 )return 1;
if(n == 2) return 2;
int fn=0;
int fn1 = 2,fn2 =1;
for(int i =3;i<=n;i++){
fn = fn1+fn2;
fn2 = fn1;
fn1 = fn;
}
return fn;
}
}*/