题解 | #跳台阶#

class Solution {
public:
    int jumpFloor(int number) {
        int fib[40]={1,1};
        for(int i=2;i<=number;++i)
        {
            fib[i]=fib[i-1]+fib[i-2];
        }
        return fib[number];
    }
};