Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Second solution in Clear category for Moore Neighbourhood by shuai
def count_neighbours(grid, row, col):
num_row, num_col = len(grid), len(grid[1])
neighbors = ((row-1, col-1), (row-1, col), (row-1, col+1),
(row, col-1), (row, col+1),
(row+1, col-1), (row+1, col), (row+1, col+1))
return sum(0 <= i < num_row and 0 <= j < num_col and grid[i][j]
for i, j in neighbors)
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"
Sept. 30, 2015
