Short, Simple, Efficient, Clear clear solution for Stair Steps by StefanPochmann - python coding challenges

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

Short, Simple, Efficient, Clear solution in Clear category for Stair Steps by StefanPochmann

def checkio(numbers):
    a = b = 0
    for n in numbers:
        a, b = b, n + max(a, b)
    return max(a, b)

April 28, 2015

Comments:

StefanPochmann on April 28, 2015, 1:52 p.m.
`a` and `b` keep track of the best sums up until the previous two steps. <a href="http://www.checkio.org/mission/stair-steps/publications/StefanPochmann/python-3/short-simple-efficient/">One-liner version</a>.

veky on May 4, 2015, 11:21 p.m.
Sentinel at the end would enable you to not duplicate max(a,b) code.

StefanPochmann on May 5, 2015, 12:09 a.m.
I had actually done that, but then decided this is clearer. Maybe I shouldn't have.

veky on May 5, 2015, 4:45 a.m.
Maybe. :-) This isn't exact science (as opposed to golfing;). ;-D

Mine

0 %

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