Climbing Stairs
时间:2014-06-04 19:30:33
收藏:0
阅读:419
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?
class Solution {
public:
int climbStairs(int n) {
int step[n];
step[0]=1;
step[1]=1;
for(int i=2;i<=n;i++)
step[i]=step[i-1]+step[i-2];
return step[n];
}
};
public:
int climbStairs(int n) {
int step[n];
step[0]=1;
step[1]=1;
for(int i=2;i<=n;i++)
step[i]=step[i-1]+step[i-2];
return step[n];
}
};
Climbing Stairs,布布扣,bubuko.com
原文:http://www.cnblogs.com/erictanghu/p/3759474.html
评论(0)