DP clear solution for Golden Pyramid by spoty - python coding challenges

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

DP solution in Clear category for Golden Pyramid by spoty

def count_gold(pyramid):
    run = [0]
    for row in pyramid:
        run = [gold + max(run[i - 1], run[i])
               for i, gold in enumerate(row)] + [0]
    return max(run)

Feb. 1, 2015

Comments:

ForcePush on Feb. 20, 2015, 11:28 a.m.
Nice DP.

breeden.christopher on July 23, 2015, 5:36 a.m.
cool, pretty much the same thing i had, but shorter.

Sedfer on Oct. 30, 2015, 12:21 p.m.
Nice idea to save only 1 row in DP.

nanpa on Dec. 14, 2015, 10:56 a.m.
Excuse me, but for what did you use list(0)? <pre class='brush: python'>[0] </pre> and <pre class='brush: python'>+ [0] </pre>

nanpa on Dec. 14, 2015, 11:54 a.m.
Ah, for the part, run[i-1]?

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!