• 递推关系：2^(n-)；
class Solution {
public:
    int jumpFloorII(int number) {
        int result = 1;
        while (--number) {
            result *= 2;
        }
        return result;;

    }
};