First clear solution for Golden Pyramid by Amachua - python coding challenges

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

First solution in Clear category for Golden Pyramid by Amachua

""" 
This function will first change the tupple into a list which isn't immutable
Next it will compute, for each column of the pyramid the maximum value of each case.
"""
def count_gold(pyramid):
    pyramid = [list(p) for p in pyramid]
    for j in range(len(pyramid)-2, -1, -1):
    	for i in range(len(pyramid[j])):
    		pyramid[j][i]+= pyramid[j+1][i] if pyramid[j+1][i] > pyramid[j+1][i+1] else pyramid[j+1][i+1]
    return pyramid[0][0]

May 1, 2014

Comments:

MMM_AAA_NNN on March 23, 2015, 6:23 p.m.
<p>It is not very clear, I had to spend some time to understand how it works. But otherwise nice solution.</p>

Look up in the Dict()

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.