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?
用动态规划的思路去做
基本的思路就是,有i节台阶的话,那么其可能性就是
f[i]=f[i]+f[i-1]+f[i-2];
class Solution {
public:
int climbStairs(int n) {
if(n==0) return 0;
int f[n+1];
f[0]=0;
f[1]=1;
f[2]=2;
for (int i=3;i<=n;i++)
{
f[i]=0;
f[i]=f[i]+f[i-1]+f[i-2];
}
return f[n];
}
};