Climbing Stairs
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?
My Submitted Code
菲比那切数列问题
class Solution {
public:
int climbStairs(int n) {
// if(n == 1){ //递归法容易溢出
// return 1;
// }
// if(n == 2){
// return 2;
// }
// return climbStairs(n-1)+climbStairs(n-2);
// 1 2 3 5 8 13 21
int* result=new int[n];
result[0]=1;
result[1]=2;
for(int i=2;i<n;i++){
result[i]=result[i-1]+result[i-2];
}
int res=result[n-1];
delete [] result;
return res;
}
};