题解 | #跳台阶#递归解决
跳台阶
http://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
public class Solution {
public int jumpFloor(int target) {
if( target == 1) {
return 1;
}else if( target == 2){
return 2;
}else{
return jumpFloor(target-2) + jumpFloor(target-1);
}
}
}
public int jumpFloor(int target) {
if( target == 1) {
return 1;
}else if( target == 2){
return 2;
}else{
return jumpFloor(target-2) + jumpFloor(target-1);
}
}
}
查看3道真题和解析
