slice clear solution for Moore Neighbourhood by gyahun_dash - python coding challenges

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

slice solution in Clear category for Moore Neighbourhood by gyahun_dash

def count_neighbours(grid, row, col):
    rs, cs = [slice(max(0, x - 1), x + 2) for x in (row, col)]

    return sum(e for r in grid[rs] for e in r[cs]) - grid[row][col]

Oct. 4, 2014

Comments:

veky on Oct. 4, 2014, 2:50 p.m.
Cool. Not really general, but here is a nice hack someone might find amusing: you can replace max(0, x - 1) with x - bool(x). ;-)

gyahun_dash on Oct. 5, 2014, 6:13 a.m.
Thank you. <blockquote> you can replace max(0, x - 1) with x - bool(x). ;-) </blockquote> What a cool hack! I'll try it when publishing some solutions in Creative or Speedy. :)

Sim0000 on Oct. 5, 2014, 6:49 a.m.
x-(x>0) is more shorter :-)

veky on Oct. 5, 2014, 8:31 a.m.
Yes, cool. slaps forehead :-)

gyahun_dash on Oct. 5, 2014, 6:56 a.m.
awesome

vinc on Oct. 5, 2014, 10:23 a.m.
sum(sum(r[cs]) for r in grid[rs])

gyahun_dash on Oct. 6, 2014, 3:32 p.m.
Nice, but I hesitated to use double-sums at that time.

SergeyMiletskiy on June 16, 2015, 11:55 a.m.
Nice! How do you do this? :-))

Vincent_Fan on March 31, 2016, 5:31 p.m.
cool!

GitHub

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.