力扣爬楼梯【斐波那契数列变形】(c++实现)

class Solution {
    const static int N=50;
    int f[N];
public:
    int climbStairs(int n) {
        f[1]=1;f[2]=2;
        if(n>2) 
            for(int i=3;i<=n;i++)   f[i] = f[i-1]+f[i-2];
        return f[n];
    }

};