#🔒 pascal's triangle with recursion

6 messages · Page 1 of 1 (latest)

lean trailBOT
#

@hidden night

Python help channel opened

Remember to:

  • Ask your Python question, not if you can ask or if there's an expert who can help.
  • Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
  • Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.
hidden night
# 
def pascal(n):
    if n == 0:
        return []
    
    elif n == 1:
        return [[1]]
    
    new_row = [1]
#

this is what i currently have, i'm planning on recursively finding the row, then adding one to the end

#

nvm i did it

lean trailBOT
#
Python help channel closed using Discord native close action

This help channel has been closed. Feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.