题目:
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
思路:
这道题用斐波那契数列的思想:f(n)=f(n-1)+f(n-2)。我认为是在f(n-1)种方案再添加上1和在f(n-2)种方案再添加上一个2的总和。
代码:
class Solution {
public:
int climbStairs(int n) {
vector<int> way(n+1);
way[0]=0;
way[1]=1;
way[2]=2;
for(int i=3;i<=n;++i){
way[i]=way[i-1]+way[i-2];
}
return way[n];
}
};