思路:
public class Solution { //关键是分析!跟斐波那契数列一样道理
public int JumpFloor(int target) {
if(target<=0)
return 0;
if(target==1||target==2)
return target;
int one =0;
int two =1;
int N=0;
for(int i=1;i<=target;i++){
N=one+two;
one=two;
two=N;
}
return N;
}
}