Offer

问题描述

解题思路

实现源码

class Solution {public:    int jumpFloorII(int number) {        int f[99999];        f[0] = 1;        f[1] = 2;        for (int i = 2; i < number; i++) {            f[i] = 2 * f[i-1];        }        return f[number-1];    }};