Offer prove safety [10] The rectangular cover (Python implementation)

Title Description

We can use a small rectangle 2 * 1 sideways or vertically to cover a larger rectangle. Will the small rectangle of n 2 * 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:

Solution one: a circular list method

# -*- coding:utf-8 -*-
class Solution:
    def rectCover(self, number):
        if number <= 0:
            return 0
        list = [1,2]
        while number>=2:
            list[0],list[1] = list[1], list[0]+list[1]
            number -= 1
        return list[0]