Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Moore Neighbourhood by sce-mp
def count_neighbours(grid, row, col):
num_cols = len(grid[0])
num_rows = len(grid)
nb_indexes = [(-1,-1),(-1,0),(-1,1), # row above
( 0,-1), (0,1), # same row
( 1,-1), (1,0), (1,1)] # row below
count = 0
for nb in nb_indexes:
row_idx = row + nb[1]
col_idx = col + nb[0]
if 0 <= row_idx < num_rows and 0 <= col_idx < num_cols:
count = count + grid[row_idx][col_idx]
return count
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"
Aug. 21, 2015
Comments:
