题解 | #斐波那契数列#

递归

1. 确定开始两项的值；
2. 确定递推关系为前两项的和

class Solution {
public:
    int jumpFloor(int number) {
        if (number == 1) return 1;
        if (number == 2) return 2;
        return jumpFloor(number - 1) + jumpFloor(number - 2);
    }
};