力扣：爬楼梯

class Solution {
    private : map<int,int> m;
    public:
    int climbStairs(int n) {
        if (n == 1) return 1;
        if (n == 2) return 2;  
        if (m.find(n) != m.end())  return m[n];
        else {
            int result = climbStairs(n-1) + climbStairs(n-2);
            m[n] = result;
            return result;
        }
    }
};

class Solution {
    private : map<int,int> m;
    public:
    int climbStairs(int n) {
        if (n == 1) return 1;
        if (n == 2) return 2;  
        int result = 0;
        int pre = 2;
        int prepre = 1;
        for (int i = 2 ; i < n ; i++) {
            result = pre + prepre;
            prepre = pre;
            pre = result;
        }
        return result;
    }
};