Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
neigh solution in Clear category for Moore Neighbourhood by ail
def count_neighbours(grid, row, col):
rows = [r for r in [row, row - 1, row + 1] if check_num(r, len(grid))]
cols = [c for c in [col, col - 1, col + 1] if check_num(c, len(grid[0]))]
count = 0
for r in rows:
for c in cols:
if r == row and c == col:
continue
count += grid[r][c]
return count
def check_num(item, len_):
if item < 0 or item > len_ - 1:
return False
return True
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"
Oct. 2, 2015
Comments: