offer

问题描述

解题思路

实现源码

class Solution {public:    int jumpFloor(int number) {        long long f[50];        f[0] = 1;        f[1] = 2;        if(number <= 2)            return f[number-1];        for(int i = 2; i < number; i++)            f[i] = f[i-1] + f[i-2];        return f[number-1];    }};