Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
My Moore solution in Clear category for Moore Neighbourhood by rohitsaini111
def count_neighbours(grid, row, col):
cell_len = len(grid[0])
limitx1 = limity1 = 0
limitx2 = row
limity2 = col
if (row > 0):
limitx1 = row-1
if (row < cell_len-1):
limitx2 = row+1
if (col>1):
limity1 = col-1
if (col < cell_len-1):
limity2 = col+1
cnt = sum([grid[i][j] for i in range(limitx1,limitx2+1) for j in range(limity1,limity2+1)])
return cnt - grid[row][col]
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert count_neighbours(((1, 0, 0, 1, 0),
(0, 1, 0, 0, 0),
(0, 0, 1, 0, 1),
(1, 0, 0, 0, 0),
(0, 0, 1, 0, 0),), 1, 2) == 3, "1st example"
assert count_neighbours(((1, 0, 0, 1, 0),
(0, 1, 0, 0, 0),
(0, 0, 1, 0, 1),
(1, 0, 0, 0, 0),
(0, 0, 1, 0, 0),), 0, 0) == 1, "2nd example"
assert count_neighbours(((1, 1, 1),
(1, 1, 1),
(1, 1, 1),), 0, 2) == 3, "Dense corner"
assert count_neighbours(((0, 0, 0),
(0, 1, 0),
(0, 0, 0),), 1, 1) == 0, "Single"
Jan. 15, 2016
