题解 | #跳台阶#(斐波那契数列)
跳台阶
http://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
public class Solution {
public int jumpFloor(int target) {
if(target == 1){
return 1;
}
if(target == 2){
return 2;
}
return jumpFloor(target - 1) + jumpFloor(target - 2);
}
}
