third time's a charm 3rd party solution for Ground for the House by ssk8 - python coding challenges

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

third time's a charm solution in 3rd party category for Ground for the House by ssk8

from numpy import rot90


def horizontal_use(plan):
    indices = [i for row in plan for i, p in enumerate(row) if p]
    return 0 if not indices else max(indices) - min(indices) + 1


def house(plan):
    p = [[p == '#' for p in row] for row in plan.split()]
    return horizontal_use(p) * horizontal_use(rot90(p))

Sept. 5, 2018

Comments:

Merzix on Sept. 7, 2018, 1:55 p.m.
There is a function for finding (max-min) called <a href="http://docs.scipy.org/doc/numpy/reference/generated/numpy.ptp.html">numpy.ptp</a> if that's useful for you <pre class='brush: python'>max(indices) - min(indices) == ptp(indices) </pre>

ssk8 on Sept. 7, 2018, 2:41 p.m.
I had it in but got a type error and removed it. In the meantime I realized I just needed int(): <pre class='brush: python'>from numpy import rot90, ptp def horizontal_use(plan): indices = [i for row in plan for i, p in enumerate(row) if p] return 0 if not indices else ptp(indices) + 1 def house(plan): p = [[p == '#' for p in row] for row in plan.split()] return int(horizontal_use(p) * horizontal_use(rot90(p))) </pre> Thanks

Merzix on Sept. 7, 2018, 3:03 p.m.
Oh, I see, thanks.

Escher

0 %

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