Recursive solution with arguments row and col initialized to 0. clear solution for Golden Pyramid by Phil15 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Recursive solution with arguments row and col initialized to 0. solution in Clear category for Golden Pyramid by Phil15

def count_gold(pyramid, row=0, col=0):
    """Return max possible sum in a path from top to bottom"""
    if row==len(pyramid)-1:
        return pyramid[row][col]
    return pyramid[row][col] + max(
        count_gold(pyramid, row+1, col),
        count_gold(pyramid, row+1, col+1))

April 7, 2018

Comments:

obone on July 6, 2019, 6:10 p.m.
Looking good, but you can use: if row < len(pyramid): ... else: ... instead of: if row==len(pyramid)-1: It will be more readable, I guess.

Look up in the Dict()

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!