Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Moore Neighbourhood by vuz3
def count_neighbours(grid, row, col):
search = 0
try:
for x in range(len(grid)):
for y in range(len(grid[x])):
if(x == (row-1) or x == (row+1)):
if((y == (col-1) or y == col or y == (col+1)) and 1 == int(grid[x][y])):
search = search + 1;
if(x == row):
if((y == col-1 or y == (col+1)) and 1 == int(grid[x][y])):
search = search + 1
except:
print('')
return search
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,1,0,1),
(0,1,0,1,0),
(1,0,1,0,1),
(0,1,0,1,0),
(1,0,1,0,1),
(0,1,0,1,0),), 5, 4)
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"
Dec. 21, 2015
Comments:
