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?
Note: Given n will be a positive integer.
思路:动态规划法。这个爬楼梯问题是个经典的动态规划问题,(哈哈,小学第一次遇到),初始化状态不爬和爬一层都是1,状态方程是f[i]=f[i-1]+f[i-2].
class Solution {
public:
int climbStairs(int n) {
int f[n+1];
f[0]=1;
f[1]=1;
for(int i=2;i<=n;i++){
f[i]=f[i-1]+f[i-2];
}
return f[n];
}
};