明明和跳台阶以及斐波那契数列一样啊,但是显示超时
另一种数组方法可以通过
运行时间:30ms
占用内存:5728k
# -*- coding:utf-8 -*-
class Solution:
def rectCover(self, number):
# write code here
if number == 1:
return 1
if number == 0:
return 0
num = [0,1,2]
for i in range(3,number+1):
num.append(num[i-1]+num[i-2])
return num[-1]