跳台阶
一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
class Solution:
def jumpFloor(self, number):
# write code here
list=[0,1]
if number<2:
return list[number]
fibOne = 1;
fibTwo = 1;
fibN = 0;
for i in range(2,number+1):
fibN = fibOne + fibTwo;
fibTwo = fibOne;
fibOne = fibN;
return fibOne