题解 | #跳台阶#
跳台阶
http://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
class Solution {
public:
int jumpFloor(int number) { // 本题我是用递归解决的~ 很容易可以想到
if(number == 1) return 1;
if(number == 2) return 2;
return jumpFloor(number-1) + jumpFloor(number-2);
}
};