题目:
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台阶数的方法数之和,所以想到用递归。(但是由于是尾递归,所以也可以用循环来替换。)
代码:
class Solution {
public:
int climbStairs(int n) {
if(n == 1 || n == 2)
{
return n;
}
if(n<=0)
{
return 0;
}
else
{
return climbStairs(n-1) + climbStairs(n-2);
}
}
};