【leetcode】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?

---

题解，变相的斐波那契数列。

代码如下：

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