Climbing Stairs

问题：

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到2阶，问有多少种上楼方案。这个符合斐波那契数列。

solution1 递归方法(这种方法的缺点就是太耗时了，leetcode上提示超时)

class Solution {
public:
    int climbStairs(int n) {
        if(n==0)
            return 0;
        else if(n==1)
            return 1;
        else if(n==2)
            return 2;
        else
            return climbStairs(n-1)+climbStairs(n-2);
    }
};

solution2动态规划方法

class Solution {
public:
    int climbStairs(int n) {
        vector<int> res(3);
        res[0]=1;
        res[1]=1;
        for(int i=2;i<=n;++i)
        {
            res[i%3]=res[(i-1)%3]+res[(i-2)%3];
        }
        return res[n%3];
    }
};