How to solve the problem of rectangular covering by python

This article introduces the relevant knowledge of "how to solve the rectangular coverage problem with python". In the operation of actual cases, many people will encounter such a dilemma, so let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

Rectangular covering problem

We can cover the larger rectangle with 21 small rectangles horizontally or vertically. How many ways are there to cover a large 2n rectangle with n 21 small rectangles without overlap? For example, in the case of nasty 3, there are three ways to cover the rectangular block of 23.

Analysis.

After reasoning, the Fibonacci sequence is changed.

Code # We can cover a larger rectangle with a small rectangle of 2 to 1 horizontally or vertically. Could you tell me how many ways there are to cover a large 2n rectangle with n 2x1 small rectangles without overlap? # for example, when nasty 3 There are three overlay methods for rectangle blocks #-*-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: return self.rectCover (number-1) + self.rectCover (number-2)''class Solution: def rectCover (self) Number): sum = 0a = 1b = 2 if number==1: sum = an elif number==2: sum = b else: for i in range (3 Number+1): sum = ahumb a = b = sum return sumif _ _ name__ ='_ _ main__': sl = Solution () print (sl.rectCover (3)) print (sl.rectCover (4)) print (sl.rectCover (5)) print (sl.rectCover (6)) "python how to solve the rectangular covering problem" ends here Thank you for your reading. If you want to know more about the industry, you can follow the website, the editor will output more high-quality practical articles for you!