题目描述
我们可以用21的小矩形横着或者竖着去覆盖更大的矩形。请问用n个21的小矩形无重叠地覆盖一个2*n的大矩形,总共有多少种方法?
代码:
# -*- coding:utf-8 -*-
class Solution:
def rectCover(self, number):
# write code here
if number == 0:
return 0
elif number == 1:
return 1
elif number == 2:
return 2
else:
temp1 = 1
temp2 = 2
result = 0
for i in range(2,number):
result = temp1+temp2
temp1 = temp2
temp2 = result
return(result)
n = input()
result = Solution().rectCover(int(n))
print(result)