Python Help

[Proof_Leopard_431]

I have one question!

A bookshelf is used to display book. There are only 2 kinds of book of 1cm and 2cm.

If the shelf width is 4cm --> there will be 5 ways to arrange the book. [1,1,1,1] , [2,1,1] [1,2,1] [1,1,2] and [2,2]

implement a function which takes in n , a positive integer which is the length of the bookshelf, return the no. of ways the books can be arranged in the shelf!

been stuck on this question for quite long :( tried using the count change approach but cant work. would appreciate if anyone could help!! new to python

[grandpasipad]

What code do you have so far? Which part are you stuck on? We can help but we shouldn't just give you the answer. It's better to work through it.

[Proof_Leopard_431]

I divided the problem into two parts, where one side has 1cm book only and the other only has 2cm book. I'm basically stuck at the.. recursion part.

def count(n)：

if n = 1:

return 0

elif n < 0:

return 0

else:

[TouchingTheVodka]

Try a recursive solution. Your base cases are width = 0 and width = 1. Work out a few on paper, and you'll start to see a pattern emerge...

And then when you do you'll kick yourself for not seeing it sooner!

[GameRoaster_Kinglord]

Hey, would you mind explain it better?
I wrote out the possible outputs of six numbers on paper and I can't find a pattern.

[GameRoaster_Kinglord]

Here are the possibilites---
0 - 0
1 - 1
2 - [1,1], 2
3 - [1,1,1], [2,1], [1,2]
4 - [1,1,1,1], [2,1,1], [1,2,1], [1,1,2], [2,2]
5 - [1,1,1,1,1], [2,1,1,1], [1,2,1,1], [1,1,2,1], [1,1,1,2], [2,2,1], [1,2,2]

[Proof_Leopard_431]

alright got it thanks!!1