[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> result;
        result.push_back(0);
        result.push_back(1);
        result.push_back(2);
        if(n <= 2) {
            return result[n];
        }
        for(int i = 3; i <= n; i++) {
            result.push_back(result[i - 2] + result[i - 1]);
        }
        return result[n];
    }
};

思路：

典型的f(n) = a*f(n-1) + b*f(n-2) +...的题，本题公式f(n)=f(n-1)+f(n-2)

登n级阶梯，可以是登n-1级阶梯后再登1级，也可以是登n-2级阶梯后再登2级。所以登n级阶梯的方法数，就是登n-1级和n-2级的种类数之和