思路:num >= 1 的斐波那契数列数列
class Solution {
public:
int jumpFloor(int number) {
if(number == 1)
{
return 1;
}
else if(number == 2)
{
return 2;
}
else
{
return jumpFloor(number - 1) + jumpFloor(number - 2);
}
}
};