递归算法递归算法

跳台阶

跳台阶_牛客题霸_牛客网

class Solution {

public:

    int jumpFloor(int number) {

        if (number<=1) return 1;

        return jumpFloor(number-1)+jumpFloor(number-2);

    }

};