Old Wei wins the offer to take you to learn --- Brush title series (10 rectangular cover)

10. The rectangular footprint

problem:

We can use 2 small rectangle 1 of sideways or vertically to cover a larger rectangle. Will the use of n 2 small rectangle 1 coverage without overlap a large rectangle 2 * n, a total of how many ways?

For n = 3 for example, 2 * 3 tile is covered There are three methods:

solve:

thought:

This question is still Fibonacci thought of Fibonacci

python code:

# -*- coding:utf-8 -*-
class Solution:
    def __init__(self):
        self.dynamic=[None]*100
    def rectCover(self, number):
        # write code here
        result=self.dynamic[number]
        if(result==None):
            if(number==0):
                result=0
            elif(number==1):
                result=1
            elif(number==2):
                result=2
            else:
                result=self.rectCover(number-1)+self.rectCover(number-2)
            self.dynamic[number]=result
        return result