问题:
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.
思路:
其实是一个斐波那契数列:
当n=1时只有一种情况;
当n=2时有两种情况;
当n>2时长度为N可以看做n-1又爬了长为1的一步或者n-2爬了长为2的一步,并且这两种情况不会有重合,所以这两种情况之和即为所求;
代码:
class Solution {
public:
int climbStairs(int n) {
int res;
if (n<=0)
res=0;
if (n==1)
res=1;
if (n==2)
res=2;
else {
int r1=1;
int r2=2;
for(int i=2;i<n;i++) {
res=r1+r2;
r1=r2;
r2=res;
}
}
return res;
}
};