First clear solution for Golden Pyramid by m600 - 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 m600

def count_gold(pyramid):
    pyramid = [list(tup) for tup in pyramid]
    for i in range(1, len(pyramid)):
        for j in range(0, i+1):
            k = j-1 
            if k < 0:
                k = 0
            l = j
            if l == len(pyramid[i-1]):
                l -= 1
            pyramid[i][j] = max(pyramid[i][j] + pyramid[i-1][k], pyramid[i][j] + pyramid[i-1][l])
    return max(max(pyramid))

July 5, 2015

Comments:

hrvoje on July 5, 2015, 10:33 p.m.
Very nice, clear and effective! :) Here are few tips: You don't need the max(max(pyramid)), the maximum is in the last sublist, so a simple max(pyramid[-1]) is enough. Instead of list comprehension in the 2nd line, you could have used map(list, pyramid). for i in range(len(something)) can be written like for i,j in enumerate(something), so now you have both the list elements (as j) and indexes (as i). To start from a different value, simply use enumerate(something, start=1)

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.