classSolution:defrectCover(self, number):if number <=2:return number
else:
n_2 =1
n_1 =2for n inrange(3, number+1):
res = n_2 + n_1
n_2 = n_1
n_1 = res
return res
JZ10 矩形覆盖用一个21的小矩形去覆盖2n大矩形时有两种选择,靠左放竖着放->剩余2*(n-1)的矩形需要覆盖横着放->必须再选择一块横着放,剩余2*(n-2)的矩形需要覆盖即f(n)=f(n-1)+f(n-2) 转化为斐波那契数列问题class Solution: def rectCover(self, number): if number <= 2: return number else: