题目:
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.
Example 1:
Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps
Example 2:
Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step
题意:
n个台阶的楼梯,每次能够上1或2个台阶,有多少种不同到达顶部的走法?
思路:
斐波那契数列的问题。。。递归会超时。。。递推公式:当n>2,f(n)=f(n-1)+f(n-2)
Code:
class Solution {
public:
int climbStairs(int n) {
long long a[n+2];
a[0]=0;
a[1]=1;
a[2]=2;
for(int i=3;i<n+1;i++){
a[i]=a[i-1]+a[i-2];
}
return a[n];
}
};