一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
java
public class Solution {
public int JumpFloor(int target) {
if (target <= 0) {
return 0;
}
if (target <= 2) {
return target;
}
int[] f = new int[target + 1];
f[0] = 0;
f[1] = 1;
f[2] = 2;
for (int i = 3; i < target + 1; i++) {
f[i] = f[i - 1] + f[i - 2];
}
return f[target];
}
}
python
# -*- coding:utf-8 -*-
class Solution:
def jumpFloor(self, number):
# write code here
if number <= 0:
return 0
if number == 1:
return 1
if number == 2:
return 2
f = [0] * (number + 1)
f[0], f[1], f[2] = 0, 1, 2
for i in range(3, number + 1):
f[i] = f[i - 1] + f[i - 2]
return f[number]