accumulate clear solution for How Deep by quarkov - python coding challenges

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

accumulate solution in Clear category for How Deep by quarkov

from itertools import accumulate


how_deep = lambda structure: max(accumulate([(-1) ** (e == ")") for e in str(structure) if e in "()"]))

April 20, 2019

Comments:

Oksana_Antropova on April 23, 2019, 5:33 a.m.
<p>That's a really cool solution! Mine had the same logic behind, but is implemented with simple <pre class='brush: python'>for</pre>, <pre class='brush: python'>if</pre> and <pre class='brush: python'>max</pre>. I've learnt quite a few of curious tricks from this solution!</p>

quarkov on April 23, 2019, 1:17 p.m.
<p>I've seen your solution - I did <a href="https://py.checkio.org/mission/how-deep/publications/quarkov/python-3/simple/">the same</a> at the first approach =)</p>

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!