题解 | #跳台阶#
跳台阶
http://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
public class Solution { public int jumpFloor(int target) { if(target == 1) return 1; if(target == 2) return 2; //其实就是跳上前1阶台阶的数量加上前2阶台阶的数量 return jumpFloor(target-1) + jumpFloor(target - 2); } }
